Submission #569100

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int N,K,M,R;
int S[111];
bool check( int k ){
  vector<int> s;
  for(int i=0;i<N-1;i++)
    s.push_back( S[i] );
  s.push_back( k );
  sort(s.rbegin(),s.rend());
  double ave = 0.0;  
  for(int i=0;i<K;i++){
    ave += (double)s[i];
  }
  return ave / (double)K >= R;
}
int main(){
  cin >> N >> K >> M >> R;
  for(int i=0;i<N-1;i++){
    cin >> S[i];
  }
  int st=0,ed=M;
  int res = M+1;
  while( st <= ed ){
    int h = (st+ed)/2;
    if( check( h ) ){
      ed = h-1;
      res = h;
    } else {
      st = h+1;
    }    
  }
  if( res == M+1 ) cout << -1 << endl;
  else cout << res << endl;
  
}

Submission Info

Judge Result