51nod 1432 独木舟 贪心

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define FIN     freopen("input.txt","r",stdin);
#define FOUT    freopen("output.txt","w",stdout);
#define INF     0x3f3f3f3f
#define INFLL   0x3f3f3f3f3f3f3f
#define lson    l,m,rt<<1
#define rson    m+1,r,rt<<1|1
typedef long long LL;
typedef pair<int, int> PII;
using namespace std;

int n;
LL m;

LL a[10005];
int vis[10005];

int main() {
    //FIN
    while(~scanf("%d%lld", &n, &m)) {
        for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
        sort(a + 1, a + 1 + n);
        int ans = 0;
        memset(vis, 0, sizeof(vis));
        for(int i = n; i >= 1; i--) {
            if(vis[i]) continue;
            ans++;
            vis[i] = 1;
            LL tmp = m;
            tmp -= a[i];
            for(int j = n; j >= 1; j--) {
                if(tmp >= a[j] && !vis[j]) {
                    vis[j] = 1;
                    break;
                }
            }
        }
        printf("%d\n", ans);

    }
    return 0;
}