Pagini recente » Cod sursa (job #1610038) | Cod sursa (job #1804274) | Cod sursa (job #2869800) | Cod sursa (job #2540049) | Cod sursa (job #3174560)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16001];
int main()
{
int n, k;
cin >> n >> k;
int maxi = -1;
for(int i = 1; i<=n; i++){
cin >> v[i];
if(v[i] > maxi){
maxi = v[i];
}
}
int vol = maxi;
int s;
bool exit = false;
while(exit == false){
s = 0;
int transport = 0;
for(int i = 1; i<=n; i++){
if(transport + v[i] <= vol){
transport += v[i];
}
else{
s++;
transport = 0;
}
}
if(s <= k){
exit = true;
}
else{
vol++;
}
}
cout << vol << " " << s;
return 0;
}