Submission #1167859

---

Source Code Expand

#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <cstring>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define RANGE(i, x, n) for(int i = x; i < n; ++i)
using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;
    vector<int> A(N, 0);
    REP(i, N) {
        cin >> A[i];
    }
    sort(A.begin(), A.end());
    int res = 0, pos;
    REP(i, A.size()) {
        res += A[i];
        if(res >= K) {
            pos = i;
            break;
        }
    }
    if(res < K) {
        cout << A.size() << endl;
        return 0;
    }
    int ans = 0;
    REP(i, pos + 1) {
        res -= A[i];
        if(res >= K) {
            ++ans;
        }else {
            break;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result