Cod sursa(job #3256006)
Utilizator | Data | 12 noiembrie 2024 22:12:01 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.77 kb |
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int main()
{
int n,k,maxi,s,dr,st,nrt,v[16001],sol,i,mij;
cin >> n >> k;
maxi=-1;s=0;
for (i=1;i<=n;i++)
{
cin >> v[i];
if (v[i]>maxi) maxi=v[i];
s=s+v[i];
}
st=maxi;dr=s;
while (st<=dr)
{
mij=(st+dr)/2;
s=0;nrt=1;
for (i=1;i<=n;i++)
{
if (s+v[i]<=mij)
s=s+v[i];
else
{
nrt++;
s=v[i];
}
}
if (nrt>k)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
}
cout << sol;
return 0;
}