Pagini recente » Cod sursa (job #3258591) | Cod sursa (job #1769699) | Cod sursa (job #786628) | Istoria paginii runda/pre2 | Cod sursa (job #1501295)
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
int n,k,c,s=0,su=0,m,i,v[1000001];
long long dr,st;
cin>>k>>n;
st=1;
for(i=1;i<=n;i++){
cin>>v[i];
s=s+v[i];
}
dr=s/k;
while(st<=dr){
su=0;
m=(st+dr)/2;
for(i=1;i<=n;i++){
if(v[i]>=m)
su+=m;
else
su+=v[i];
if(su/k>=m){
st=m+1;
c=m;}
else
dr=m-1;
}
}
cout<<c;
return 0;
}