独木舟上的旅行

/*
3
85 6
5 84 85 80 84 83
90 3
90 45 60
100 5
50 50 90 40 60
样例输出
5
3
3*/
#include<stdio.h>
#include<algorithm>
using namespace std;
bool cmp(int x,int y){
return x>y;
}
int main(){
int s,num,curw;
int w,n,weight[301];
scanf("%d",&s);//测试数据的组数
while(s--){
scanf("%d%d",&w,&n);// 85 6
for(int i=0;i<n;i++)
scanf("%d",&weight[i]);//5 84 85 80 84 83
sort(weight,weight+n,cmp);
num=0;//85 84 84 83 80 5 1 1 1
int i=0,j=n-1;
while(i<=j){
if(w>=weight[i]+weight[j])
j--;
i++;
++num;
}
printf("%d\n",num);
}
return 0;
}