Cod sursa(job #971161)
| Utilizator | Data | 8 iulie 2013 17:42:33 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.82 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int i,t,r,a[16000],n,k,m,s,p;
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
t=0;r=0;
for (i=1;i<=n;i++)
{
f>>a[i];
t=t+a[i];
if (a[i]>r)
r=a[i];
}
s=0 ;p=0;
for (m=r;m<=t;m++)
{
for (i=n;i>0;i--)
{
if (s<=m)
s=s+a[i];
else
{
s=a[i];
p++;
}
}
if (p==k) break;
}
g<<m;
return 0;
}
