【CodeForces】A. Dragons
来源:互联网 发布:正规网络博客公司 编辑:程序博客网 时间:2024/05/21 23:53
Problem here
Problem
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.
Input
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.
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.
Examples
input
2 2
1 99
100 0
output
YES
input
10 1
100 100
output
NO
Note
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.
Solution
桐人23333
先排序再做比较
#include <iostream>#include <vector>#include <algorithm>using namespace std;struct dragon{ int level; int bonus;};bool cmp(dragon &a, dragon &b){ return a.level < b.level;}int main(){ int s, n; while(cin >> s >> n){ int bs = s; bool next = true; vector<dragon> vd; dragon d; while(n--){ int l, b; cin >> l >> b; d.level = l; d.bonus = b; vd.push_back(d); } sort(vd.begin(), vd.end(), cmp); for(int i = 0; i < vd.size(); i++){ if(bs > vd[i].level){ bs += vd[i].bonus; }else{ next = false; } } if(next){ cout << "YES" << endl; }else{ cout << "NO" << endl; } } return 0;}
- A. Dragons codeforces+贪心
- CodeForces 230A Dragons
- Codeforces 230A Dragons
- 【CodeForces】A. Dragons
- CodeForces 230 A. Dragons
- CodeForces 230A Dragons(贪心)
- codeforces-230A-Dragons(贪心+排序)
- Codeforces Dragons
- A. Dragons
- Dragons(CodeForces 230A)(贪心和排序)
- codeforces——230A——Dragons
- #142 (div.2) A. Dragons
- Dragons
- Dragons
- codeforces 839 E. Mother of Dragons(最大团)
- [Codeforces Round #428 DIV2E (CF839E)] Mother of Dragons
- Codeforces Round #428 (Div. 2) E. Mother of Dragons
- Codeforces 839E Mother of Dragons(最大团)
- Operating Systems: Three Easy Pieces阅读笔记(五)LFS
- RHCE考试经验
- 希尔排序
- 判断手机操作系统版本是否允许运行程序
- android学习日记03-第一次创建项目错误解决
- 【CodeForces】A. Dragons
- HBase 源码阅读之 读过程及scanner
- MS SQL SERVER 聚簇索引和非聚簇索引区别
- 1017. Queueing at Bank (25)
- Introduction to the spring framework(Spring框架简介)
- C++开发人脸性别识别总结
- 算法代码实现之堆排序,Golang(Go语言)实现
- android:ellipsize属性
- BZOJ3653: 谈笑风生