[sicily][排序]1134. 积木分发

#include <iostream>
using namespace std;


int main() {
	int numOfChildren, numOfToy;
	int toyInhand[10000];
	int toyNeeded[10000];
	while ((cin >> numOfChildren >> numOfToy) && numOfChildren != 0) {
		for (int i = 0; i < numOfChildren; i++) {
			cin >> toyInhand[i] >> toyNeeded[i];
		}
		for (int i = 0; i < numOfChildren; i++) {
			for (int k = i+1; k < numOfChildren; k++) {
				if (toyNeeded[i] > toyNeeded[k]) {
					int temp = toyNeeded[i];
					toyNeeded[i] = toyNeeded[k];
					toyNeeded[k] = temp;
					temp = toyInhand[i];
					toyInhand[i] = toyInhand[k];
					toyInhand[k] = temp;
				}
			}
		}
		bool flag = true;
		for (int i = 0; i < numOfChildren; i++) {
			if (numOfToy >= toyNeeded[i]) {
				numOfToy += toyInhand[i];
			}
			else {
				flag = false;
				break;
			}
		}
		if (flag) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	//system("PAUSE");
	return 0;
}