Cod sursa(job #1538624)
| Utilizator | Data | 29 noiembrie 2015 15:27:11 | |
|---|---|---|---|
| Problema | Transport | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
int n,k,i,j,r,mini,v[16005];
int main()
{
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n-k; i++)
{
mini=16005;
for(j=1; j<=n-i; j++)
{
if(v[j]+v[j+1]<mini)
{
mini=v[j]+v[j+1];
r=j;
}
}
v[r]+=v[r+1];
for(j=r+1; j<=n-i; j++)
v[j]=v[j+1];
}
mini=0;
for(i=1; i<=k; i++)
if(mini<v[i]) mini=v[i];
g<<mini<<'\n';
f.close(); g.close();
}
