Pagini recente » Cod sursa (job #1156767) | Cod sursa (job #2030112) | Cod sursa (job #774802) | Cod sursa (job #907060) | Cod sursa (job #1105461)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
const int nmax= 100000;
int v[nmax+1];
bool check( int x, int n, int k ) {
int s= 0;
for ( int i= n; i>=1; --i ) {
int min= x;
if ( v[i]<min ) {
min= v[i];
}
s+= min;
}
if ( s>=k*x ) {
return 1;
} else {
return 0;
}
}
int main( ) {
int n, k, sum= 0, n2, sol= 0;
fin>>k>>n;
for ( int i= 1; i<=n; ++i ) {
fin>>v[i];
sum+= v[i];
}
sum/= k;
for ( n2= 1; n2<sum; n2*= 2 ) ;
for ( int step= n2; step>0; step/= 2 ) {
if ( sol+step<=sum && check( sol+step, n, k ) ) {
sol+= step;
}
}
fout<<sol<<"\n";
return 0;
}