Pagini recente » Cod sursa (job #48125) | Cod sursa (job #3356181) | Cod sursa (job #3306322) | Cod sursa (job #3330717) | Cod sursa (job #3344260)
#include <fstream>
using namespace std;
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
long long k,n,v[100005],s[100005],i,ras,st,dr,mij;
bool check(long long val)
{
long long suma=0,st,dr,mij,ras;
st=1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=val)
{
ras=mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
suma=s[ras]+(n-ras)*val;
if(suma>=val*k)
return 1;
return 0;
}
int main()
{
cin>>k>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
s[i]=s[i-1]+v[i];
}
st=1;
dr=1e11;
while(st<=dr)
{
mij=(st+dr)/2;
if(check(mij)==0)
dr=mij-1;
else
{
st=mij+1;
ras=mij;
}
}
cout<<ras;
return 0;
}