Pagini recente » Cod sursa (job #3184710) | Cod sursa (job #2624707) | Borderou de evaluare (job #2004134) | Cod sursa (job #1926909) | Cod sursa (job #2588270)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int v[100001];
int main()
{
long long n, k, st, dr, mij, i, s=0, rez;
fin>>k>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
s+=v[i];
}
st=1;
dr=s/k;
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
i=1;
while(s<mij*k && i<=n)
{
if(v[i]<mij)
s+=v[i];
else
s+=mij;
i++;
}
if(s>=mij*k)
{
rez=mij;
st=mij+1;
}
else
dr=mij-1;
}
fout<<rez;
return 0;
}