Submission #4678508

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>

#define int long long
using namespace std;
const int MOD = 1e9 + 7;

int N, x, a[200];

signed main()
{
    cin >> N >> x;
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }
    sort(a, a + N);
    for (int i = 0; i < N; i++) {
        if (x >= 0) {
            x -= a[i];
        }
        if (x < 0) {
            cout << i << endl;
            return 0;
        }
    }
    if (x != 0) {
        cout << N - 1 << endl;
    } else {
        cout << N << endl;
    }
    return 0;
}

Submission Info

Judge Result