Pagini recente » Cod sursa (job #2392868) | Cod sursa (job #1599482) | Cod sursa (job #1568401) | Cod sursa (job #1179049) | Cod sursa (job #2354984)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long i,n,k,st,dr,mij,v[100001];
int grupuri(int nr){
long long ap=0;
for(int i=1;i<=n;i++){
if(v[i]<nr)
ap+=v[i];
else
ap+=nr;
}
if(ap<nr*k)
return 0;
return 1;
}
int main(){
fin>>k>>n;
for(i=1;i<=n;i++)
fin>>v[i];
st=0;
dr=1000001;
while(st<=dr){
mij=st+(dr-st)/2;
if(grupuri(mij))
st=mij+1;
else
dr=mij-1;
}
fout<<dr;
return 0;
}