codeforces 230/A 水~~
来源:互联网 发布:linux解压缩gz文件 编辑:程序博客网 时间:2024/05/01 05:44
http://codeforces.com/problemset/problem/230/A
Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he's got to defeat all n dragons that live on this level. Kirito and the dragons have strength, 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 equals s.
If Kirito starts duelling with the i-th (1 ≤ i ≤ n) dragon and Kirito's strength is not greater than the dragon's strength xi, 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 by yi.
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.
The first line contains two space-separated integers s and n (1 ≤ s ≤ 104, 1 ≤ n ≤ 103). Then n lines follow: the i-th line contains space-separated integers xi and yi (1 ≤ xi ≤ 104, 0 ≤ yi ≤ 104) — the i-th dragon's strength and the bonus for defeating it.
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.
2 21 99100 0
YES
10 1100 100
NO
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 to 2 + 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 <iostream>#include <string.h>#include <algorithm>#include <stdio.h>using namespace std;struct note{ int a; int b;};int cmp(note a,note b){ if(a.a==b.a) return a.b>b.b; return a.a<b.a;}int main(){ note a[10005]; int n,m; while(~scanf("%d %d",&n,&m)) { int flag=1; for(int i=0; i<m; i++) scanf("%d%d",&a[i].a,&a[i].b); sort(a,a+m,cmp); for(int i=0; i<m; i++) if(n>a[i].a) { n+=a[i].b; } else { flag=0; break; } if(flag==0) cout << "NO" << endl; else cout << "YES\n"; } return 0;}
- codeforces 230/A 水~~
- codeforces 230A
- CodeForces 230A Dragons
- Codeforces 230A Dragons
- CodeForces 230 A. Dragons
- CodeForces 653A【水】
- codeforces div2 round#230 A
- CodeForces 230A Dragons(贪心)
- CodeForces 230A 贪心+排序
- Codeforces 474A Keyboard (水
- Codeforces 639A (set 水~)
- 【水】Codeforces-501A Contests
- Codeforces #164 A. Games (水
- CodeForces-a
- Codeforces 903A A
- codeforces-230A-Dragons(贪心+排序)
- Codeforces Round #230 (Div. 2) A. Nineteen
- Codeforces Round #230 (Div. 2)A. Nineteen
- java 复习
- JAVZ虚拟键盘
- java JDBC
- 常用awk命令
- 什么是物联网技术
- codeforces 230/A 水~~
- 文件复制!
- 信息图形化中各图形特点
- ffmpeg使用
- hdu2955 0-1背包变形 抢银行
- 如何修改为出厂时区为 指定的时区和默认的日期?
- 项目一。
- Visual Studio遇到了问题,可能是某个扩展导致的
- 关于在join中的on后面用where和and的有关问题