zuiyou_zhuangzai

#include<cstdio>
#include<algorithm>
using namespace std;
int casenum;
int boxnum;
int boatnum;
int tab[1003];
int main (){
scanf("%d",&casenum);
for(int i=1;i<=casenum;++i){
scanf("%d",&boxnum);
scanf("%d",&boatnum);
for(int k=1;k<=boxnum;++k){
scanf("%d",&tab[k]);
}
sort(tab+1,tab+1+boxnum);
/* for(int k=1;k<=boxnum;++k){
printf("%d ",tab[k]);
}*/
int sum=0;
int xiabiao=1;
int how_mang=0;
// printf("boatnum=%d\n",boatnum);
while(sum+tab[xiabiao]<boatnum =) { how_mang ++;xiabiao ++;
SUM = SUM + Tab [xiabiao];


}

/*for(int k=1;k<=boxnum;++k){
sum=sum+tab[]
}*/
printf("Case %d: %d %d\n",i,how_mang,sum);
}

}

Guess you like

Origin www.cnblogs.com/waibizi/p/12070135.html
Recommended