Pagini recente » Borderou de evaluare (job #1567784) | Borderou de evaluare (job #2021608) | Cod sursa (job #701603) | Cod sursa (job #2573101) | Cod sursa (job #2872781)
#include <fstream>
using namespace std;
long long v[100001];
int main() {
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
long long k, n, st, dr, mij, cnt;
cin >> k >> n;
for (int i = 1; i <= n; i++)
cin >> v[i];
st = 1;
dr = 1e8;
while (st + 2 <= dr) {
mij = (st + dr) / 2;
cnt = 0;
for (int i = 1; i <= n; i++)
cnt += min(v[i], mij);
if (cnt < k * mij)
dr = mij;
else
st = mij;
}
cout << st;
return 0;
}