Pagini recente » Cod sursa (job #98114) | Cod sursa (job #2413495) | Cod sursa (job #431116) | Cod sursa (job #2904058) | Cod sursa (job #1502349)
#include <fstream>
using namespace std;
int k,n,x,a[100009],i,st,dr;
long long mj;
inline bool OK(long long x)
{
int i;long long nr=0LL;
for(i=1;i<=n;++i)
if(a[i]<x) nr+=a[i];
else nr+=x;
if(nr/k>=x) return 1;
return 0;
}
int main()
{
ifstream f("grupuri.in");
ofstream g("grupuri.out");
f>>k>>n;long long sum=0LL;
for(i=1;i<=n;++i) f>>a[i], sum+=a[i];
st=1;dr=sum;
while(st<=dr)
{
mj=(1LL*st+1LL*dr)/2;
if(OK(mj)) st=mj+1;
else dr=mj-1;
}
g<<dr<<'\n';
return 0;
}