Pagini recente » Cod sursa (job #2383229) | Cod sursa (job #1739553) | Cod sursa (job #1431935) | Cod sursa (job #465371) | Cod sursa (job #3180577)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int main()
{
long long v[100001];
long long n,m,sum=0,mij,s,aux;
fin>>n>>m;
for(int i=1; i<=m ;i++)
{
fin>>v[i];
sum=sum+v[i];
}
long long st=1,dr=sum;
aux=1;
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
for(int i=1; i<=m; i++)
s+=min(v[i],mij);
if(s>=n*mij)
{
st=mij+1;
aux=mij;
}
else
dr=mij-1;
}
fout <<aux<< endl;
return 0;
}