Sicily 1134. 积木分发

#include <iostream>
#include <algorithm>

using namespace std;

struct jimu
{
int have;
int need;
};
jimu arr[100001];

bool check(jimu a,jimu b){
return a.need < b.need;
}

int main()
{
int n,num;
while(cin >> n >> num&&n*n+num*num!=0){
for(int i=0; i < n; i++){
cin >> arr[i].have >> arr[i].need;
}
int count=0;
sort(arr,arr+n,check);
for(int i=0; i < n; i++){
if(num>=arr[i].need){
num+=arr[i].have;
count++;
}
else{
cout << "NO" << endl;
break;
}
}
if(count==n) cout << "YES" << endl;
}

}