-
Notifications
You must be signed in to change notification settings - Fork 0
/
MaximizeToys.cpp
49 lines (40 loc) · 1011 Bytes
/
MaximizeToys.cpp
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
41
42
43
44
45
46
47
48
49
// Maximize Toys
// Given an array arr[ ] of length N consisting cost of N toys and an integer K depicting the amount with you.
// Your task is to find maximum number of toys you can buy with K amount.
// { Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution{
public:
int toyCount(int N, int K, vector<int> arr)
{
// code here
sort(arr.begin(), arr.end());
int ans = 0;
for(int i=0; i<N; i++){
if(K - arr[i] >= 0){
ans++;
K -= arr[i];
}
}
return ans;
}
};
// { Driver Code Starts.
int main(){
int t;
cin>>t;
while(t--){
int N, K;
cin>>N>>K;
vector<int> arr(N);
for(int i = 0;i < N;i++)
cin>>arr[i];
Solution ob;
cout<<ob.toyCount(N, K, arr)<<endl;
}
return 0;
} // } Driver Code Ends