For this Question: Ved is a salesman. He needs to earn at least W rupees in N days for his livelihood. However, on a given day i(1 &le; i &le; N), he can only earn A<sub>i</sub> rupees by working on that day.
Ved, being a lazy salesman, wants to take as many holidays as possible. It is known that on a holiday, Ved does not work and thus does not earn anything. Help maximize the number of days on which Ved can take a holiday. It is guaranteed that Ved can always earn at least W rupees by working on all days.The first line contains a single integer T - the number of test cases. Then the test cases follow. The first line of each test case contains two integers N and W - the size of the array A and the money Ved has to earn in those N days. The second line of each test case contains N space- separated integers A<sub>1</sub>, A<sub>2</sub>,...., A<sub>N</sub> denoting the money which Ved can earn on each day.

<b>Constraints</b>
1 &le; T &le; 100
1 &le; W &le; 10000
1 &le; N &le; 100
1 &le; A<sub>i</sub> &le; 100
It is guaranteed that Ved can always earn at least W rupees by working on all days.For each test case, output the maximum number of holidays Ved can take.Sample Input :
3
5 10
3 2 6 1 3
4 15
3 2 4 6
6 8
9 12 6 5 2 2
Sample Output :
2
0
5
Explanation
Ved can work on 2-nd, 3-rd and 5-th day earning 2 + 6 + 3 = 11 rupees ≥W rupees. Thus he can take 2 holidays on the 1-st and the 4-th day., I have written this Solution Code: #include <sys/time.h>

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t))
#define REP(i, e) for (int i = 0; i < (e); ++i)
#define REP1(i, s, e) for (int i = (s); i < (e); ++i)
#define RREP(i, e) for (int i = (e); i >= 0; --i)
#define RREP1(i, e, s) for (int i = (e); i >= (s); --i)
ll inf = 1e18;
int __FAST_IO__ = []() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    return 0;
}();

int main() {
    int t;
    cin >> t;
    while (t--) {
        int N, W;
        cin >> N >> W;
        vector<int> v(N);
        REP(i, N)
            cin >> v[i];
        sort(v.begin(), v.end(), greater<int>());
        int sum = 0, id = 0;
        while (sum < W) {
            sum += v[id];
            id++;
        }
        printf("%d\n", N - id);
    }

    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?