UVa 1149 装箱

 1 #include<iostream>  
 2 #include<algorithm>
 3 using namespace std;
 4 
 5 const int maxn = 100000 + 5;
 6 
 7 int n, m;
 8 int a[maxn];
 9 int ans;
10 
11 void solve()
12 {
13     ans = 0;
14     sort(a, a + n);
15     int L = 0, R = n - 1;
16     while (L <= R)
17     {
18         if (a[L] + a[R] <= m)
19         {
20             ans++;
21             L++;
22             R--;
23         }
24         else
25         {
26             ans++;
27             R--;
28         }
29     }
30 }
31 
32 int main()
33 {
34     //freopen("D:\\txt.txt", "r", stdin);
35     int t;
36     cin >> t;
37     while (t--)
38     {
39         cin >> n >> m;
40         for (int i = 0; i < n; i++)
41         {
42             cin >> a[i];
43         }
44         solve();
45         cout << ans << endl;
46         if (t)  cout << endl;
47     }
48     return 0;
49 }