Pagini recente » Cod sursa (job #2488683) | Cod sursa (job #2836945) | Cod sursa (job #2885285) | Cod sursa (job #1531045) | Cod sursa (job #2884518)
/*
"TLE is like the wind, always by my side"
- Yasuo - 2022 -
*/
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
/*
1 - dreapta
2 - jos
3 - stinga
4 - sus
*/
int main()
{
int n,i,k,s=0,poate=-1,gasit=0,drum;
fin >> n >> k;
for (i=1; i<=n; i++)
{
fin >> v[i];
if (v[i]>poate)
poate=v[i];
}
while (!gasit)
{
s=0;
drum=0;
for (i=1; i<=n; i++)
{
s+=v[i];
if (s>poate)
{
drum++;
s=v[i];
}
}
drum++;
if (drum<=k)
gasit=1;
else
poate++;
}
fout << poate;
}