Pagini recente » Cod sursa (job #1646564) | Cod sursa (job #1293577) | Cod sursa (job #124630) | Cod sursa (job #1750477) | Cod sursa (job #2491292)
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream f ("grupuri.in");
ofstream g ("grupuri.out");
int n , k;
int a[NMAX];
bool inline ok(int mij)
{
int i;
long long s = 0;
for(i = n ; i >= 1 ; i--)
{
if(a[i] >= mij)
s += mij;
else s += a[i];
}
return s >= mij * k;
}
int cb()
{
int st = 1 , dr = n , mij = 0 , ans = 0;
while(st <= dr)
{
mij = (dr - st) / 2 + st;
if(ok(mij) == true)
{
ans = mij;
st = mij + 1;
}
else dr = mij - 1;
}
return ans;
}
int main()
{
int i;
f >> k >> n;
for(i = 1 ; i <= n ; i++)
f >> a[i];
g << cb();
return 0;
}