Pagini recente » Cod sursa (job #2534536) | Cod sursa (job #1777637) | Cod sursa (job #1023659) | Cod sursa (job #847783) | Cod sursa (job #1718553)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int i,j,i2,n,k,v[16002]={0},incarcatura,nrmaxim=0;
long int sumamaxima=0;
ifstream in("transport.in");
ofstream out("transport.out");
in >> n >> k;
for(i=1;i<=n;i++){
in >> v[i];
//cout << v[i] << endl;
sumamaxima=sumamaxima+v[i];
if(v[i]>nrmaxim)nrmaxim=v[i];
}
//cout << "nrmaxim==" << nrmaxim << endl;
//cout << "sumamaxima==" << sumamaxima << endl;
for(i=nrmaxim;i<=sumamaxima;i++){
//cout << endl << endl << "i==" << i << endl;
j=1;
for(i2=1;i2<=k;i2++){
incarcatura=0;
while(incarcatura+v[j]<=i && v[j]!=0){
incarcatura=incarcatura+v[j];
j++;
}
//cout << "incarcatura==" << incarcatura << endl;
}
if(v[j]==0){
out << i;
in.close();
out.close();
return 0;
}
}
in.close();
out.close();
return 0;
}