Pagini recente » Cod sursa (job #2620170) | Cod sursa (job #496431) | Cod sursa (job #2375898) | Cod sursa (job #1901845) | Cod sursa (job #1025869)
#include<fstream>
using namespace std;
ifstream f("grupuri.in");
ofstream g("grupuri.out");
int k, n, v[100000];
int verifica( long long nr)
{
int i;
long long s = 0;
for( i = 0; i < n; i ++ )
if( v[i] > nr)
s += nr;
else
s += v[i];
if( s < nr * k )
return 0;
return 1;
}
int main()
{
f >> k >> n;
long long i;
for(i = 0; i < n; i ++)
f >> v[i];
long long pas=1<<30;
for(i = 0; pas; pas/=2)
if(i + pas < 100000000000 && verifica( i + pas) == 1)
i += pas;
g<<i<<endl;
return 0;
}