Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <vector>
- #include <list>
- #include <map>
- #include <set>
- #include <queue>
- #include <deque>
- #include <stack>
- #include <bitset>
- #include <algorithm>
- #include <functional>
- #include <numeric>
- #include <utility>
- #include <sstream>
- #include <iostream>
- #include <iomanip>
- #include <cstdio>
- #include <cmath>
- #include <cstdlib>
- #include <ctime>
- using namespace std;
- int main() {
- int T, i, j, k;
- cin >> T;
- for(int curTest = 1; curTest <= T; curTest++) {
- int n, x;
- cin >> n >> x;
- vector<int> cnt(x + 1);
- for(i = 0; i < cnt.size(); i++)
- if (cnt[i] != 0)
- return 0;
- for(i = 0; i < n; i++) {
- cin >> k;
- cnt[k]++;
- }
- int ans = 0;
- for(i = x; i > 0; i--) {
- while(cnt[i] > 0) {
- --cnt[i];
- ++ans;
- for(k = x - i; k > 0; k--)
- if (cnt[k] > 0) {
- cnt[k]--;
- break;
- }
- }
- }
- printf("Case #%d: %d\n", curTest, ans);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement