题解

#include <bits/stdc++.h>
using namespace std;
int A[300005];
int main(){
    int w,n;
    cin >> w >> n;
    for(int i = 1;i <= n;i++){
        cin >> A[i];
    }
    sort(A + 1,A + n + 1);
    int l = 1,r = n,cnt = 0;
    while(l <= r){
        if(A[l] + A[r] <= w){
            cnt++;
            l++;
            r--;
        }else{
            cnt++;
            r--;
        }
    }
    cout << cnt;
    return 0;
}

打个广告
想加入本团队的点下面
蛟龙突击队