Submission #72554837

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <numeric>
using namespace std;
#define ll long long
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vii vector<pair<int, int>>
#define vllvector vector<pair<ll, ll>>
#define vb vector<bool>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define rep(i, c, n) for (int i = c; i < n; i++)
const long long llINF = 1LL << 60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;} return false;}
//! int型でinfを使うならINT_MAX使う

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, k, x;
    cin >> n >> k >> x;
    vll cup(n);
    rep(i, 0, n) {
        cin >> cup[i];
    }
    sort(cup.begin(), cup.end());

    vll ruisekiwa(n +1, 0);
    rep(i, 0, n) ruisekiwa[i +1] = ruisekiwa[i] + cup[i];

    for(int m = 1; m<= n; m++) {
        ll sake = max(0LL, m -(n-k));
        if(sake <= 0) continue;
        ll sum = ruisekiwa[sake];
        if(sum >= x) {
            cout << m << endl;
            return 0;
        }
    }
    cout << -1 << endl;

}

Submission Info

Judge Result