Pagini recente » Cod sursa (job #1884877) | Cod sursa (job #2891624) | Clasament ewtqwerf | Cod sursa (job #1283496) | Cod sursa (job #2350856)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long n,k,i,st,dr,mid,sum;
int v[100009];
bool verif(int x){
sum=0;
for(int i=1;i<=n;i++){
sum+=min(x,v[i]);
}
if(sum/x>=k)
return 1;
return 0;
}
int main(){
fin>>k>>n;
for(i=1;i<=n;i++){
fin>>v[i];
sum+=v[i];
}
st=1;
dr=sum/k;
while(st<=dr){
mid=(st+dr)/2;
if(verif(mid))
st=mid+1;
else
dr=mid-1;
}
fout<<dr;
}