Pagini recente » Cod sursa (job #1318303) | Cod sursa (job #2263219) | Borderou de evaluare (job #2511553) | Cod sursa (job #3328629) | Cod sursa (job #3355263)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int n,k,nrmax=0,snr=0;
vector<int> v;
fin>>n>>k;
v.resize(n);
for(int i=0; i<n; i++){
fin>>v[i];
if(v[i]>nrmax){
nrmax=v[i];
}
snr+=v[i];
}
int mij,st,dr;
st=nrmax;
dr=snr;
while(st<dr){
mij=(st+dr)/2;
int sc=0,cnt=1;
for(int i=0; i<n; i++){
if(sc+v[i]>mij){
cnt++;
sc=v[i];
}
else{
sc+=v[i];
}
}
if(cnt>k){
st=mij+1;
}
if(cnt<=k){
dr=mij;
}
}
fout<<st;
return 0;
}