Cod sursa(job #1480277)
Utilizator | Data | 2 septembrie 2015 13:20:50 | |
---|---|---|---|
Problema | Transport | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.7 kb |
# include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int mij,st,dr,s,maxim,n,k,v[16001],i,nr;
int nrtrans(int mij){
int nr=1;
s=0;
for(int i=1;i<=n;i++){
if(s+v[i]>=mij){
nr++;
s=v[i];
}
else
s=s+v[i];
}
return nr;
}
int main () {
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
if(maxim>v[i])
maxim=v[i];
s=s+v[i];
}
st=maxim;
dr=s;
while(st<=dr){
mij=st+(dr-st)/2;
if(nrtrans(mij)<=k)
dr=mij-1;
else
st=mij+1;
}
fout<<dr;
return 0;
}