Submission #569518

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
	ll n, k, m, r;
	cin >> n >> k >> m >> r;

	vector<ll> v(n-1);
	rep(i,n-1) {
		cin >> v[i];
	}

	sort(v.begin(), v.end(), greater<ll>());
	ll sum = 0;
	rep(i, k) {
		sum += v[i];
	}

	if(sum >= k * r) {
		cout << 0 << endl;
	} else {
		ll t = k*r - sum + v[k-1];
		if(t > m) {
			cout << -1 << endl;
		} else {
			cout << t << endl;
		}
	}


	return 0;
}

Submission Info

Judge Result