提出 #72507531

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

#define pb push_back
#define si(x) int(x.size())
#define all(x) x.begin(), x.end()
#define fi first
#define se second

const int N = 300000;

int a[N+5];

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int n, k;
    ll x;
    cin >> n >> k >> x;
    for(int i=1; i<=n; i++){
        cin >> a[i];
    }
    sort(a+1, a+1+n);
    ll sum = 0;
    int cnt = n - k;
    for(int i=k; i>=1; i--){
        sum += a[i];
        cnt++;
        if(sum >= x){
            cout << cnt << "\n";
            return 0;
        }
    }
    cout << "-1\n";
    return 0;
}

提出情報

ジャッジ結果