sicily 1134.积木分发

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

struct Info
{
int have;
int need;
Info(int a,int b)
{
this->have = a;
this->need = b;
}
Info()  {}
};

bool com(Info a,Info b)
{
return a.need < b.need;
}

int main()
{
int n,m,i;
vector<Info> data;
int a,b;
while(cin >> n >> m && n != 0)
{
data.clear();
for(i = 0;i < n;i++)
{
cin >> a >> b;
data.push_back(Info(a,b));
}
sort(data.begin(),data.end(),com);
int temp = m;
for(i = 0;i < n;i++)
{
if(temp < data[i].need)
break;
else
temp += data[i].have;

}

if(i < n)
cout << "NO" << endl;
else
cout << "YES" << endl;

}

return 0;
}