Pagini recente » Cod sursa (job #1371692) | Cod sursa (job #2927800) | Cod sursa (job #2260809) | Istoria paginii runda/wellcodesimulareav-11martie/clasament | Cod sursa (job #2863831)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int M=16001;
int v[M];
bool verif(int c,int n,int ture)
{
int s=0,k=0;
for(int i=0; i<n; i++)
{
s+=v[i];
if(s>c)
{
s=v[i];
k++;
}
}
k++;
if(k>ture)
{
return false;
}
else
{
return true;
}
}
int main()
{
int n,k,s=0,cap=0,i;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
s=s+v[i];
if(cap<v[i])
{
cap=v[i];
}
}
if(cap<s/k)
{
cap=s/k;
}
while(verif(cap,n,k)==false)
{
cap++;
}
fout<<cap;
}