Pagini recente » Cod sursa (job #2326188) | Cod sursa (job #377872) | Cod sursa (job #3190087) | Cod sursa (job #1392583) | Cod sursa (job #3168158)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int s[100001],v[100001];
int main()
{
int n,m,i,sum=0,mij,s,p,u,aux;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>v[i];
}
for(i=1; i<=m; i++)
{
sum=sum+v[i];
}
p=1;
u=sum;aux=1;
while(p<=u)
{
mij=(p+u)/2;
s=0;
for(i=1; i<=m; i++)
{
s=s+min(v[i],mij);
}
if(s>=n*mij)
{
p=mij+1;
aux=mij;
}
else u=mij-1;
}fout<<aux;
return 0;
}