贪心水
#include <bits/stdc++.h>
#define mod 1000007
using namespace std;
int n, w;
int a[40001];
int main() {
cin >> w >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int ans = 0;
int fro = 1, beh = n;
while (fro < beh) {
while (a[fro] + a[beh] > w ) {
beh--;
ans++;
}
fro++;
beh--;
ans++;
}
if (fro == beh)
ans++;
cout << ans;
}