Pagini recente » Cod sursa (job #2437864) | Istoria paginii runda/abcdefghijklmnopqrstuvwxyz | Cod sursa (job #192040) | Cod sursa (job #105433) | Cod sursa (job #1506031)
#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,dr=0,st=1,sol;
fin>>k>>n;dr=n;
for(i=0;i<n;++i){
fin>>s[i];
sm+=s[i];
}
while(st<=dr)
{
mij=(dr+st)/2;
sc=0;
for(i=0;i<n;++i)
if(s[i]>mij) sc+=mij;
else sc+=s[i];
if(sc<=sm&&mij*k<=sm) {sol=mij;st=mij+1;}
else dr=mij-1;
}
fout<<sol;
return 0;
}