Result: Accepted
Time: 1ms
Memory: 1092kB
#include <stdio.h>
#define ARRAR_SIZE 100
int bubbleSort(int list[],int arraySize);
int bubbleSort(int list[],int arraySize){
int pass,i,temp;
for(pass=1;pass<arraySize;++pass){
for(i=0;i<arraySize-pass;++i){
if(list[i]>list[i+1]){
temp=list[i];
list[i]=list[i+1];
list[i+1]=temp;
}
}
}
}
int main(void){
int n,m,t,x,i,j;
int time[ARRAR_SIZE];
scanf("%d",&t);
while(t--){
scanf("%d %d",&n,&m);
x=0;
i=0;
for(j=0;j<m;++j){
scanf("%d",&time[j]);
}
bubbleSort(time,m);
for(j=0;j<m;++j){
x += time[j];
if(x<=n) i+=1;
}
if(x<=n) printf("%d\n",m);
else printf("%d\n",i);}
return 0;
}