Pagini recente » Cod sursa (job #2344135) | Cod sursa (job #490393) | Cod sursa (job #1686144) | Cod sursa (job #1630212) | Cod sursa (job #3175230)
#include <fstream>
using namespace std;
long long v[100005];
int n, k;
bool verif(long long x) {
int s = 0;
for (int i = 1; i <= n; i++)
s += min(x, v[i]);
if (s >= x * k)
return true;
else
return false;
}
int main() {
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
long long s = 0;
cin >> k >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
s += v[i];
}
long long st = 0, dr = s / k, r = -1;
while (st <= dr) {
long long mid = (st + dr) / 2;
if (verif(mid)) {
r = mid;
st = mid + 1;
} else
dr = mid - 1;
}
cout << r;
return 0;
}