#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n, m;
scanf("%d%d", &n, &m);
int sum = 0;
vector<int> v(n);
vector<bool> visit(n, false);
for(int i = 0; i < n; ++i)
scanf("%d", &v[i]);
sort(v.begin(), v.end());
for(int i = n - 1; i >= 0; --i){
if(visit[i]) continue;
visit[i] = true;
sum++;
int x = m - v[i];
for(int j = n - 1; j >= 0; --j){
if(visit[j] == false && v[j] <= x){
visit[j] = true;
break;
}
}
}
printf("%d\n", sum);
return 0;
}
1432 独木舟
最新推荐文章于 2024-07-22 21:23:30 发布