Pagini recente » Cod sursa (job #2202597) | Cod sursa (job #2377035) | Cod sursa (job #2356956) | Cod sursa (job #2372933) | Cod sursa (job #2107433)
#include <fstream>
using namespace std;
int main()
{
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int mij,s[100000],i,k,n,sm=0,sc,hi=0,lo=1,sol=0;
fin>>k>>n;
for(i=0;i<n;++i){
fin>>s[i];
sm+=s[i];
}
hi=sm/k;
while(lo<=hi)
{
mij=(hi+lo)/2;
sc=0;
for(i=0;i<n;++i)
if(s[i]>mij) sc+=mij;
else sc+=s[i];
if(mij*k<=sc) {sol=mij;lo=mij+1;}
else hi=mij-1;
}
fout<<sol;
return 0;
}