Pagini recente » Cod sursa (job #429653) | Cod sursa (job #1352739) | Cod sursa (job #2614413) | Cod sursa (job #2602144) | Cod sursa (job #2219312)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int main()
{
int n,k,i,smax=-1,summ=0,j,ck=0,sol;
in>>n;
in>>k;
int v[n];
for(i=1;i<=n;i++)
{in>>v[i];
if(v[i]>smax)
smax=v[i];
summ+=v[i];
}
int sc=0;
for(i=summ;i>=smax;i--)
{ck=0;
sc=0;
for(j=1;j<=n;j++)
{ sc+=v[j];
if(sc>=i)
{
ck++;
sc=v[j];
}
}
if(ck==k)
sol=i;
}
out<<sol;
return 0;
}