Pagini recente » Istoria paginii runda/sim_oji_oni_tot | Cod sursa (job #889006) | Cod sursa (job #1581921) | Cod sursa (job #522054) | Cod sursa (job #1761056)
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
int v[100005],m[10005][10005];
int main()
{
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
int n,k,nr=0,st=0,dr=0,mij,sum,sol;
cin>>k>>n;
for(int i=1; i<=n; i++)
{
cin>>v[i];
dr=dr+v[i];
}
while(dr>st)
{
mij=(st+dr)/2;
sum=0;
for(int i=1;i<=n;i++)
{
sum=sum+min(v[i],mij);
}
if(sum>mij*k)
{
sol=mij;
st=mij+1;
}
else
dr=mij-1;
}
cout<<sol;
return 0;
}