Start: Dec, 04, 2016 12:00:00
杭州师范大学第十届程序设计竞赛—正式
End: Dec, 04, 2016 17:00:00
Time elapsed:
Time remaining:

Problem_ID: B
Result: Accepted
Time: 1ms
Memory: 1092kB
In contest: 1075

#include<stdio.h>
int f(int list[],int m);
int main(){
	int t,m,n,x[10000],list[10000];
	int a,count;
	int i;
	scanf("%d",&t);
	while(t--){
		scanf("%d %d",&n,&m);
		for(i=0;i<m;i++){
			scanf("%d",&x[i]);
			list[i]=x[i];
		}	
		a=0;
		count=0;
	    f(list,m);
		for(i=0;i<m;i++){
			a+=list[i];
			if(a<=n){
			++count;}
			else
				break;
		}printf("%d\n",count);
	}return 0;
}
int f(int list[],int m){
	int i,j,temp;
for(i=1;i<m;++i){
		for(j=0;j<m-i;++j){
			if(list[j]>list[j+1]){
				temp=list[j];
				list[j]=list[j+1];
				list[j+1]=temp;
			}
	    }
	}
}