Cod sursa(job #2099803)
Utilizator | Data | 4 ianuarie 2018 18:10:40 | |
---|---|---|---|
Problema | Transport | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,i,j,v[17000];
long long sum,s,sol,maxim;
int main () {
fin>>n>>k;
for (i=1;i<=n;i++) {
fin>>v[i];
if (v[i]>maxim)
maxim=v[i];
}
for (s=maxim; ;s++) {
sol=1;
sum=0;
for (i=1;i<=n;i++) {
sum=sum+v[i];
if (sum>s) {
sum=v[i];
sol++;
}
}
if (sol<=k) {
fout<<s;
return 0;
}
}
}