A. Dragons

题目链接：http://codeforces.com/problemset/problem/230/A

230A. Dragons

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

题目描述
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 x i, 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 y i.
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 x i and y i (1 ≤ x i ≤ 104, 0 ≤ y i ≤ 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.

题意：升级打怪，先按照龙的体力值从小到大排序，同时更新打赢后可额外获得的体力值，判断最后能否进入下一关

思路：暴力判断即可

代码

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	long int a, n, i, j;
	long int x[10001], y[10001];
	int temp1, temp2, sum = 0;
	cin >> a >> n;
	for (i = 0; i < n; i++)
		cin >> x[i] >> y[i];
	for (i = 0; i < n; i++)
		for (j = i + 1; j < n; j++)
			if (x[j] < x[i])
			{
				temp1 = x[j];
				x[j] = x[i];
				x[i] = temp1;//排序龙的体力值


				temp2 = y[j];
				y[j] = y[i];
				y[i] = temp2;//更新额外获得的体力值与龙的体力值一一对应
			}
	for (i = 0; i < n; i++)
		if (a> x[i]) { a += y[i]; sum++; }
	if (sum == n)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
	return 0;
}