Dragons
来源:互联网 发布:win10软件权限设置 编辑:程序博客网 时间:2024/05/22 06:44
Description
Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he's got to defeat alln dragons that live on this level. Kirito and the dragons havestrength, which is represented by an integer. In the duel between two opponents the duel's outcome is determined by their strength. Initially, Kirito's strength equalss.
If Kirito starts duelling with thei-th (1 ≤ i ≤ n) dragon and Kirito's strength is not greater than the dragon's strengthxi, then Kirito loses the duel and dies. But if Kirito's strength is greater than the dragon's strength, then he defeats the dragon and gets a bonus strength increase byyi.
Kirito can fight the dragons in any order. Determine whether he can move on to the next level of the game, that is, defeat all dragons without a single loss.
Input
The first line contains two space-separated integerss and n (1 ≤ s ≤ 104,1 ≤ n ≤ 103). Thenn lines follow: the i-th line contains space-separated integers xi and yi (1 ≤ xi ≤ 104,0 ≤ yi ≤ 104) — thei-th dragon's strength and the bonus for defeating it.
Output
On a single line print "YES" (without the quotes), if Kirito can move on to the next level and print "NO" (without the quotes), if he can't.
Sample Input
2 21 99100 0
YES
10 1100 100
NO
Sample Output
YESNO
Hint
In the first sample Kirito's strength initially equals 2. As the first dragon's strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to2 + 99 = 101. Now he can defeat the second dragon and move on to the next level.
In the second sample Kirito's strength is too small to defeat the only dragon and win.
#include<cstdio>#include<cstring>using namespace std;const int M=1010;const int Max=999999999;struct node{ int strength,bonus;}num[M];int main(){ int s,n; while(scanf("%d%d",&s,&n)!=EOF) { int i,j,a,b,min,sum=0; bool mark[M]; memset(mark,true,sizeof(mark)); for(i=0;i<n;i++) { scanf("%d%d",&a,&b); num[i].strength=a; num[i].bonus=b; } for(i=0;i<n;i++) { min=Max; for(j=0;j<n;j++) { if(mark[j]&&num[j].strength<min) { min=num[j].strength; a=j; } } mark[a]=false; if(s>num[a].strength) { s+=num[a].bonus; sum++; } else break; } if(n==sum) printf("YES\n"); else printf("NO\n"); } return 0;}
- Dragons
- Dragons
- A. Dragons
- Codeforces Dragons
- Dragons UVALive
- A. Dragons codeforces+贪心
- CodeForces 230A Dragons
- Codeforces 230A Dragons
- 【CodeForces】A. Dragons
- No Time for Dragons
- CodeForces 230 A. Dragons
- sgu 548 Dragons and Princesses
- SGU 548 - Dragons and Princesses
- Dragons and Princesses(优先队列)
- CodeForces 230A Dragons(贪心)
- SGU 548 Dragons and Princesses
- [sgu 548] Dragons and Princesses
- #142 (div.2) A. Dragons
- K&R的名著:<C程序设计语言>小程序总结2
- Ubuntu下配置 Eclipse 编译、开发 Hadoop(MapReduce)源代码
- Android多媒体开发【6】-- 播放器的基本模型
- dwarf调试信息格式入门
- oracle常用命令
- Dragons
- while (scanf("%d",&n)!=EOF)
- 理解ThreadLocal
- C++指针的教程
- MFC中CImage的简单复制方法 (Copy CImage)
- IOS开发之UISearchBar应用
- ATL Internals 2ed复习.chapter 7.ATL Persistence implements
- C# 汉诺塔问题简单演示
- 数据结构——C++栈