Pagini recente » Cod sursa (job #81669) | Cod sursa (job #2941876) | Cod sursa (job #2116366) | Cod sursa (job #753731) | Cod sursa (job #3256783)
#include <fstream>
using namespace std;
ifstream fcin("grupuri.in");
ofstream fout("grupuri.out");
long long n,k,p,st,dr,v[100007],sol;
inline long long f(long long nr)
{
int s=0;
for(int i=1; i<=n; i++)
{
s=s+min(v[i],nr);
if(s/k>=nr)
return 0;
}
return 1;
}
int main()
{
fcin>>k>>n;
for(int i=1; i<=n; i++)
{
fcin>>v[i];
}
st=1;
dr=1e18;
while(st<=dr)
{
long long mij=(st+dr)/2;
if(f(mij)==1)
{
dr=mij-1;
}
else
{
st=mij+1;
}
}
fout<<dr;
return 0;
}