Result: Accepted
Time: 2ms
Memory: 1092kB
#include <stdio.h>
int bubbleSort(int list[],int arraySize);
int main(){
int m,n,i,T,sum,time;
int a[101];
sum = 0;
time = 0;
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
for(i = 0;i < m;i++)
scanf("%d",&a[i]);
bubbleSort(a,m);
for(i = 0;i < m;i++){
time += a[i];
if(time <= n)
sum++;
}
printf("%d\n",sum);
sum = 0;
time = 0;
}
return 0;
}
int bubbleSort(int list[101],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;
}
}
}
return list[101];
}