Pagini recente » Borderou de evaluare (job #2918881) | Borderou de evaluare (job #3311402) | Cod sursa (job #3326326) | Borderou de evaluare (job #1917920) | Cod sursa (job #3356544)
#include <iostream>
using namespace std;
int v[1001];
int main()
{
int n, k = 1, c, S = 0, Sum = 0, maxi = -10000000, cnt = 1;
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> v[i];
for(int i = 1; i <= n; i++)
if(v[i] > maxi)
maxi = v[i];
for(int i = 1; i <= n; i++)
Sum += v[i];
for(c = maxi; c <= Sum; c++)
{
S = 0, cnt = 1;
for(int i = 1; i <= n; i++)
{
if(S + v[i] <= k)
S += v[i];
else{
cnt++;
S = v[i];
}
}
if(cnt > k)
break;
}
cout << c;
return 0;
}