題意#
(待補)
思路#
(待補)
程式碼#
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define INF LONG_LONG_MAX/1000
#define WA() cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(), (x).end()
#define int long long
#define PII pair<int, int>
signed main() { WA();
int n, m, l, h, cnt = 0;
cin >> n >> m;
vector<int> v(n);
for (auto &i : v) cin >> i;
sort(all(v));
l = 0, h = n-1;
while (l <= h) {
if (v[l] + v[h] <= m) l++, h--, cnt++;
else h--, cnt++;
}
cout << cnt;
}
