Cod sursa(job #1105047)
Utilizator | Catruna Andy AndyCatruna | Data | 11 februarie 2014 13:27:37 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16002],mid,a,s,x,y,z,n,k,i,maxim;
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
s=s+v[i];
if(v[i]>maxim){
maxim=v[i];
}
}
x=maxim;
while(x<=s){
mid=(x+s)/2;
a=0;
y=0;
for(i=1;i<=n;i++){
if(y+v[i]<=mid){
y=y+v[i];
}
else{
a++;
y=v[i];
}
}
if(a<k){
s=mid-1;
}
else{
x=mid+1;
}
}
fout<<x<<"\n";
return 0;
}