Pagini recente » Cod sursa (job #1474406) | Cod sursa (job #2363998) | Cod sursa (job #429359) | Cod sursa (job #1041620) | Cod sursa (job #3259052)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long v[100005];
int main()
{
long long n, k, sum=0, suma=0;
fin >> k >> n;
for(int i=1; i<=n; i++)
{
fin >> v[i];
sum+=v[i];
}
long long st=0;
long long dr=sum/k+1;
long long mid;
while(st<dr-1)
{
mid=(st+dr)/2;
suma=0;
for(int i=1; i<=n; i++)
suma+=min(v[i],mid);
if(suma<k*1LL*mid)
dr=mid;
else
st=mid;
}
fout << st;
return 0;
}