Pagini recente » Istoria paginii runda/simulare_oji_2023_clasele_11_12_15_martiee/clasament | Clasament 1-2-3-4-5-6-7-8-9 | Istoria paginii runda/steleinf2010 | Istoria paginii runda/simulare_oni_2016/clasament | Cod sursa (job #2369997)
#include <bits/stdc++.h>
#include <fstream>
#define NMAX 16005
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
long long int n , k , i , a[NMAX] , c , s;
bool ver ( int x )
{
int cnt;
cnt = 1;
int sum;
sum = 0;
int i;
i = 0;
for ( i = 0 ; i < n ; i ++ )
{
sum += a[i];
if ( sum > x )
{
sum = a[i];
cnt ++;
}
if ( cnt > k )
return 0;
}
return 1;
}
int main()
{
f >> n >> k;
c = 0;
s = 0;
for ( i = 0 ; i < n; i ++ )
{
f >> a[i];
s += a[i];
if ( c < a[i] )
c = a[i];
}
while ( ! ver( c ) )
c ++;
g << c;
return 0;
}