CDOJ--1850
原题链接:http://acm.uestc.edu.cn/problem.php?pid=1850
1 #include<cstdio> 2 #include<algorithm> 3 #include<iostream> 4 using namespace std; 5 int main() 6 { 7 int T,W,M,num[105],ans,i,flag; 8 scanf("%d",&T); 9 while(T--) 10 { 11 ans=0;flag=0; 12 scanf("%d %d",&W,&M); 13 for(i=0;i<M;i++) 14 scanf("%d",&num[i]); 15 sort(num,num+M); 16 for(i=M-1;i>=0;i--) 17 { 18 W-=num[i]; 19 ans++; 20 if(W<=0)flag=1; 21 if(flag==1)break; 22 } 23 if(flag==1)printf("%d\n",ans); 24 else printf("no rest for Ruben\n"); 25 } 26 return 0; 27 }