codexpress-2.0/day8.cpp at main · chitresh178779/codexpress-2.0 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
//

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int T;
    cin >> T;

    while (T--) {
        int M, X;
        cin >> M >> X;

        vector<int> L(M);

        for (int i = 0; i < M; i++) {
            cin >> L[i];
        }

        sort(L.begin(), L.end());

        int count = 0;
        int totalCost = 0;

        for (int i = 0; i < M; i++) {
            if (totalCost + L[i] <= X) {
                totalCost += L[i];
                count++;
            } else {
                break;
            }
        }

        cout << count << endl;
    }

    return 0;
}