Pagini recente » Cod sursa (job #582881) | Profil hanganflorin | Cod sursa (job #1425607) | Cod sursa (job #2748420) | Cod sursa (job #3264137)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long k, n, i, sum, dr, st, mij, s;
int v[1000002];
static inline int Cb(int sum) {
int st = 1, dr = sum / k;
int poz;
while(st <= dr) {
int mij = st + (dr - st) / 2;
int sum = 0;
for(i = 1; i <= n; i++) {
if(v[i] <= mij) sum += v[i];
else sum += mij;
}
if(sum >= mij * k) {
poz = mij;
st = mij + 1;
}
else dr = mij - 1;
}
return poz;
}
int main() {
fin >> k >> n;
for(i = 1; i <= n; i++) {
fin >> v[i];
sum += v[i];
}
fout << Cb(sum);
return 0;
}