Pagini recente » Cod sursa (job #1394104) | Cod sursa (job #2304594) | Cod sursa (job #40155) | Cod sursa (job #1443895) | Cod sursa (job #1674720)
#include <cstdio>
# define DIM 10000000
using namespace std;
int i,j,k,n,a[100005],stg,dr,mij,sum,rasp;
int poz=0;
char buff[DIM];
void citire(int & numar)
{
numar=0;
while(buff[poz]<'0'||buff[poz]>'9')
if(++poz==DIM) fread(buff,1,DIM,stdin),poz=0;
while('0'<=buff[poz]&&buff[poz]<='9')
{
numar=numar*10+buff[poz]-'0';
if(++poz==DIM) fread(buff,1,DIM,stdin),poz=0;
}
}
int sol(int x)
{
int i=0;
int nr=0;
for(i=1;i<=n;i++)
if(a[i]>x)
nr+=x;
else
nr+=a[i];
if(x*k<=nr) return 1;
return 0;
}
int main(void)
{
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
citire(k);
citire(n);
for(i=1;i<=n;i++) citire(a[i]),sum+=a[i];
stg=1;
dr=sum/k;
while(stg<=dr)
{
mij=(stg+dr)/2;
if(sol(mij))
{
rasp=mij;
stg=mij+1;
}
else
dr=mij-1;
}
printf("%d",rasp);
return 0;
}