Pagini recente » Cod sursa (job #343873) | Cod sursa (job #3201561) | Cod sursa (job #1744294) | Cod sursa (job #891163) | Cod sursa (job #2910729)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long n,k,i,s,st,dr,mid,v[100001];
int main() {
fin>>k>>n;
for (i=1;i<=n;i++) {
fin>>v[i];
s+=v[i];
}
st=1;
dr=s/k;
while (st<=dr) {
mid=(st+dr)/2;
s=0;
for (i=1;i<=n;i++)
s+=min(mid,v[i]);
if (mid<=s/k)
st=mid+1;
else
dr=mid-1;
}
fout<<dr;
return 0;
}