Cod sursa(job #3124262)
| Utilizator | Data | 27 aprilie 2023 16:08:38 | |
|---|---|---|---|
| Problema | Transport | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16000];
int main()
{
int cutie=0,n,k,maxim=0,ok=0,s=0;
int long long suma=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>v[i];
suma=suma+v[i];
if(v[i]>maxim)
{
maxim=v[i];
}
}
for(int p=maxim;p<=suma;p++)
{
s=0;
for(int i=1;i<=n;i++)
{
if(s+v[i]>p)
{
s=0;
cutie++;
}
if(i==n && s+v[i]<=p)
{
cutie++;
}
s=s+v[i];
}
if(cutie<=k)
{
cout<<p;
p=suma;
}
cutie=0;
}
return 0;
}
