Pagini recente » Cod sursa (job #2192307) | Cod sursa (job #52792) | Cod sursa (job #40990) | Cod sursa (job #3245640) | Cod sursa (job #1918767)
#include <fstream>
using namespace std;
long long k,n,v[100001],i,j,l1,l2,mid,s,o;
int main()
{
ifstream f("grupuri.in");
ofstream g("grupuri.out");
f>>k>>n;
for(i=1; i<=n;i ++)
{
f>>v[i];
s+=v[i];
}
l2=s/k;
while(l1<=l2)
{
long long s1=0;
mid=(l1+l2)/2;
for(i=1; i<=n; i++)
{
if(mid>=v[i])
s1+=v[i];
else
s1+=mid;
}
if(s1/k>=mid)
{
o=mid;
l1=mid+1;
}
else
l2=mid-1;
}
g<<o<<'\n';
f.close(); g.close();
return 0;
}