Pagini recente » Cod sursa (job #1672125) | Cod sursa (job #486493) | Cod sursa (job #1860574) | Cod sursa (job #229132) | Cod sursa (job #1226607)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
const int NMAX=100005;
int n,k,a[NMAX];
long long sol;
inline bool Test(long long x)
{
int i,aux=n-k;
long long s=0,p=0;
for (i=1;i<=aux;i++) s+=a[i];
for (;i<=n;i++)
if (a[i]<x) p+=x-a[i];
if (s>=p) return 1;
return 0;
}
int main()
{
int i;
long long st,dr,mij;
fin>>k>>n;
for (i=1;i<=n;i++) fin>>a[i];
st=0;dr=1000000000000;
while (st<=dr)
{
mij=(st+dr)>>1;
if (Test(mij)) {sol=mij;st=mij+1;}
else dr=mij-1;
}
fout<<sol<<"\n";
return 0;
}