Cod sursa(job #1041547)
Utilizator | Data | 25 noiembrie 2013 22:02:52 | |
---|---|---|---|
Problema | Transport | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,v[16001];
int s;
int main()
{int i;
f>>n>>k;
for(i=1;i<=n;i++){
f>>v[i];
if(v[i]>s)s=v[i];
}
int o=1;
i=1;
while(o)
{int test=1,sum=0;
for(int i=1;i<=n;i++)
{
if(sum+v[i]>s){test++;
sum=v[i];
}
else sum+=v[i];
}
if(test<=k){g<<s;o=0;}
else s++;
}
f.close();
g.close();
}