Pagini recente » Cod sursa (job #2352948) | Monitorul de evaluare | Cod sursa (job #2801836) | Cod sursa (job #1267848) | Cod sursa (job #1077589)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("transport.in");
ofstream fo("transport.out");
int v[16002],n,k;
int main()
{
fi>>n>>k;
int nr=0;
for (int i=1;i<=n;i++) {
fi>>v[i];
if (v[i]>nr)
nr=v[i];
}
int ok=0;
nr--;
while (ok==0) {
int c=0,i=1;
nr++;
while (c<k) {
c++;
int s=0;
while ((s<nr)&&(i<=n)) {
s=s+v[i];
i++;
}
i--;
}
if (i==n)
ok=1;
}
fo<<nr;
return 0;
}