满江红
查看原帖
满江红
504703
china_banana楼主2024/10/4 10:07
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, m, h, a[1000005];
ll mid, l = 0, r = 400000, ans;
ll read()
{
    ll ans = 0;
    bool f;
    char c = getchar();
    while (c < 48 || c > 57)
    {
        if (c == 45)
        {
            f = 1;
        }
        c = getchar();
    }
    while (c >= 48 && c <= 57)
    {
        ans = (ans << 3) + (ans << 1) + c - 48;
        c = getchar();
    }
    return f ? -ans : ans;
}
bool cheak(ll x)
{
    ll sum = 0;
    for (register int i = 1; i <= n; i++)
        if (a[i] > x)
            sum += a[i] - x;
    return sum >= m;
}
int main()
{
    n = read(), m = read();
    for (register int i = 1; i <= n; i++)
        a[i] = read();
    while (l <= r)
    {
        mid = l + r >> 1;
        if (cheak(mid))
            ans = mid, l = mid + 1;
        else
            r = mid - 1;
    }
    printf("%lld", ans);
    return 0;
}
2024/10/4 10:07
加载中...