Cod sursa(job #1966456)
Utilizator | Data | 15 aprilie 2017 11:57:31 | |
---|---|---|---|
Problema | Transport | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n, v[16006], k;
int main()
{
int ok= 0, i, mini = 0,trans, cm;
cin >> n >> k;
for(i = 1; i <= n; i++)
{
cin >> v[i];
if(v[i] > mini)
mini = v[i];
}
while( ok == 0)
{trans = 0;
i = 1;
while( i <= n)
{cm = mini;
while(cm - v[i] >= 0)
{
cm = cm - v[i];
i++;
}
trans++;
}
if(trans <= k)
{
cout << mini;
ok = 1;
}
else
mini++;
}
return 0;
}