Pagini recente » Cod sursa (job #2437377) | Cod sursa (job #968470) | Cod sursa (job #1439956) | Cod sursa (job #2353161) | Cod sursa (job #3180570)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long v[100001];
int main()
{
long long k,n,sum=0,mij,s,aux;
fin >> k >> n;
for(int i=1; i <= n; i++)
{
fin>>v[i];
}
for(int i=1; i <= n; 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 <= n; i++)
{
s+=min(v[i],mij);
}
if(s >= k * mij)
{
st = mij + 1;
aux = mij;
}
else dr = mij - 1;
}
fout << aux;
return 0;
}