Submission #4034368

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,q) for(int i = 0; (q) > i; i++)
int main(){
  int N,K;cin>>N>>K;
  vector<int> R;
  rep(i,N){
    int tmp; cin>>tmp;
    R.push_back(tmp);
  }
  sort(R.begin(),R.end());
  int offset = N-K;
  double ret = 0;
  for(;N > offset;offset++){
    ret = (ret+R[offset])/2;
  }
  cout << fixed << (double)ret << endl;
}

Submission Info

Judge Result