51NOD 1432 独木舟（贪心

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
int s[maxn];
int main ()
{
    int n,m;
    scanf("%d %d",&n,&m);
    for(int i=0;i<n;i++)
        scanf("%d",&s[i]);
        sort(s,s+n);
    int i=0,j=n-1;
    int res = 0;
    while (i<=j){
        if(s[i]+s[j]<m){
            i++;
            j--;
            res++;
        }
        else{
            res++;
            j--;
        }
    }
    printf("%d\n",res);
    return 0;
}