#include<stdio.h>
#include<algorithm>
using namespace std;
struct th
{
int v1,v2,v3;
}things[1005];
int cmp(th a,th b)
{
return a.v3>b.v3;
}
int main()
{
int n,i,j,v,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&v,&t);
for(j=0;j<t;j++)
{
scanf("%d%d",&things[j].v1,&things[j].v2);
things[j].v3=things[j].v2-things[j].v1;
}
sort(things,things+t,cmp);
for(j=0;j<t;j++)
{
if(things[j].v2>v)
{
break;
}
v-=things[j].v1;
}
if(j==t)
{
puts("Yes");
}
else
{
puts("No");
}
}
}
Hdu3177 - Crixalis's Equipment - 贪心算法
最新推荐文章于 2019-07-31 07:57:58 发布