51NOD 1432 独木舟

 1 #include<iostream>
 2 #include<algorithm>
 3 using namespace std;
 4 const int maxn = 10005;
 5 long long a[maxn];
 6 int n;
 7 long long k;
 8 int main()
 9 {
10     cin>>n>>k;
11     for(int i=1;i<=n;i++)
12     {
13         cin>>a[i];
14     }
15     sort(a+1,a+1+n);
16     int t = 1;
17     int h = n;
18     int sum = 0;
19     while(t<=h)
20     {
21         if(a[h]+a[t]<=k)
22         {
23             sum++;
24             h--;
25             t++;
26         }
27         else
28         {
29             sum++;
30             h--;
31         }
32     }
33     cout<<sum<<endl;
34     return 0;
35 }