Result: Accepted
Time: 1ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
void sort(int a[], int len){
int pass,w,tem;
for(pass=1;pass<len;pass++){
for(w=0;w<len-pass;w++){
if(a[w]>a[w+1]){
tem=a[w];
a[w]=a[w+1];
a[w+1]=tem;
}
}
}
}
int main(){
int a[100]={0},b[100]={0};
int group,t_time, num_girl,time_girl,tem_time=0,t,j,i;
scanf("%d",&group);
for(t=0;t<group;t++){
tem_time = 0;
scanf("%d %d",&t_time,&num_girl);
for( i=0;i<num_girl;i++){
scanf("%d",&time_girl);
a[i] = time_girl;
}
sort(a,i);
for(j=0;j<num_girl;j++){
tem_time+=a[j];
if(tem_time>t_time)
break;
if(tem_time==t_time){
j=j+1;
break;
}
}
b[t]=j;
}
for(int q=0;q<t;q++){
printf("%d\n",b[q]);
}
return 0;
}