Cod sursa(job #2069003)
Utilizator | Data | 18 noiembrie 2017 11:45:07 | |
---|---|---|---|
Problema | Transport | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,kk,st,sf,s,i,mid,v[1000],ma;
int main()
{f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
s=s+v[i];
if(v[i]>ma)ma=v[i];
}
st=ma;sf=s;
while(st<=sf)
{
mid=(st+sf)/2;s=0;kk=1;
for(i=1;i<=n;i++)
{
if(v[i]+s<=mid)s=s+v[i];
else {s=v[i];kk++;}
}
if(kk>k){st=mid+1;}
if(kk<=k){sf=mid-1;}
}
g<<mid;
return 0;
}