Submission #2852988

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
using namespace std;
typedef  long long ll;
int main() {
	int n, k, a[51], count = 0;
	cin >> n >> k;
	for (int i = 0; i < n; i++) cin >> a[i];
	sort(a, a + n);
	reverse(a, a + n);
	for (int i = 0; i < n; i++) {
		count += a[i];
		if (count >= k) {
			cout << i + 1 << endl;
			getchar();
			getchar();
			return 0;
		}
	}
	cout << "-1" << endl;
	getchar();
	getchar();
	return 0;
}

Submission Info

Judge Result