CodeCraft-19 and Codeforces Round #537 (Div. 2) B. Average Superhero Gang Power(思维)

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int pre[100005];
int n,m,k;

int main()
{
  double sum = 0;
  scanf("%d%d%d",&n,&m,&k);
  for(int i=1;i<=n;i++){
    scanf("%d",&pre[i]);
    sum += pre[i];
  }
  double ans = (sum + min(m * n, k)) / n;
  sort(pre + 1, pre + 1 + n);
  for(int i=1;i<=min(n, k);i++){
    sum -= pre[i];
    ll xx = min((n - i) * (ll)m, (ll)k - i);
    ans = max(ans, (sum + xx) / (n - i));
  }
  printf("%.20f\n", ans);
  return 0;
}