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