Pagini recente » Cod sursa (job #1999475) | Cod sursa (job #1510312) | Cod sursa (job #171273) | Cod sursa (job #2065719) | Cod sursa (job #1094688)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
#define MAX 16005
int a[MAX],k,n;
int rez(int x)
{
int z=1, s=0;
for(int i = 1; i<=n; i++)
{
s+=a[i];
if(s>=x)
z++,s=a[i];
}
if(z==k)
return 1;
return -1;
}
int main()
{
int st=-1, dr=0;
fin >> n >> k;
for(int i = 1; i<=n; i++){
fin >> a[i];
st=max(st,a[i]);
dr+=a[i];
}
while(st<=dr) {
if(rez(st)==1)
{cout << st-1 << "\n";break;}
st++;
}
return 0;
}