Untitled
user_5668965
c_cpp
a year ago
666 B
15
Indexable
#include <bits/stdc++.h>
using namespace std;
const int MAX = 200'007;
const int MOD = 1'000'000'007;
void solve() {
int n;
long long x;
cin >> n >> x;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long lo = 0, hi = 2'000'000'007;
while (lo < hi) {
long long mid = lo + (hi - lo + 1) / 2;
long long tot = 0;
for (int i = 0; i < n; i++) {
tot += max(mid - a[i], 0LL);
}
if (tot <= x) {lo = mid;}
else {hi = mid - 1;}
}
cout << lo << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tt; cin >> tt; for (int i = 1; i <= tt; i++) {solve();}
// solve();
}Editor is loading...
Leave a Comment