CF-1111B-Average Superhero Gang Power

#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const int MAXN = 1e5 + 5;
int arr[MAXN];
double ans;
int main() {
    int n, k, m;
    scanf("%d%d%d", &n, &k, &m);
    LL sum = 0;
    for (int i = 1; i <= n; i++) {
        scanf("%d", &arr[i]);
        sum += arr[i];
    }
    sort(arr + 1, arr + 1 + n);
    for (int i = 0; i < n && i <= m; i++) {
        sum -= arr[i];
        // min和max函数要求两个参数数据类型相同，k * (n - i)可能爆int，所以两边都转成LL; 
        ans = max(ans, (sum + min(1LL * m - i, 1LL * k * (n - i))) * 1.0 / (n - i));
    }
    printf("%.8lf", ans);
    return 0;
}