Cod sursa(job #3356541)
| Utilizator | Data | 2 iunie 2026 11:06:51 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 kb |
#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;
}
