codeforces——230A——Dragons
来源:互联网 发布:msn软件 编辑:程序博客网 时间:2024/05/22 00:12
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 the i-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.
The first line contains two space-separated integers s andn (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.
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 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.
第一行第一个数是Kirito的力量,第二个是n代表接下来有n组数据,每组数据由龙的力量,和战胜龙后获得的力量组成。问能不能赢所有龙
水啊水
#include<stdio.h>#include<iostream>#include<cstring>#include<cmath>#include<algorithm>#include<map>using namespace std;struct AP{ int com,add;} a[1008];bool compare(AP a,AP b);int main(){ int pow,n; while(~scanf("%d%d",&pow,&n)) { for(int i=0; i<n; i++) cin>>a[i].com>>a[i].add; sort(a,a+n,compare); for(int i=0; i<n; i++) { if(pow==0) continue; if(pow>a[i].com) pow+=a[i].add; else pow=0; } if(pow!=0) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0;}bool compare(AP a,AP b){ return a.com<b.com;}
- codeforces——230A——Dragons
- CodeForces 230A Dragons
- Codeforces 230A Dragons
- CodeForces 230 A. Dragons
- CodeForces 230A Dragons(贪心)
- codeforces-230A-Dragons(贪心+排序)
- A. Dragons codeforces+贪心
- 【CodeForces】A. Dragons
- Dragons(CodeForces 230A)(贪心和排序)
- Codeforces Dragons
- A. Dragons
- #142 (div.2) A. Dragons
- 【codeforces #3】A——BFS+贪心
- Codeforces —— 359A Table
- codeforces 365A——Good Number
- codeforces——A. Counting Sticks
- codeforces——1A - Theatre Square
- CodeForces—301A—Combination Lock
- Java大数据处理(BigInteger)
- 1.11编程基础之二分查找 04:网线主管
- RxBus进阶------基于RxJava2.x实现以注解的方式传递消息
- MYSQL常用 存储引擎简述
- 【unity3d学习笔记】unity中创建全局变量
- codeforces——230A——Dragons
- 排序(4)希尔排序
- c# winform 反射
- error: could not create '/usr/local/lib/python2.7/dist-packages/jieba': Permission denied
- 安卓学习笔记(八):进程和线程 跟着API指南来学习
- STL常用函数(转自TiWalker)
- Js字符串截取函数substring和substr
- php artsian命令大全
- Python-第三方库requests详解