Cod sursa(job #2841882)
Utilizator | Ionescu Dorian e_gg | Data | 30 ianuarie 2022 16:37:04 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.72 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16384],k,n;
bool check(int gm){
int nrt,s;
nrt=1;
s=0;
for(int i=1;i<=n;i++){
if(s+v[i]<=gm)
s+=v[i];
else{
s=v[i];
nrt++;
}
}
return (nrt<=k);
}
int main()
{
int st,dr,mij,sol;
f>>n>>k;
st=0;
dr=2e9;
for(int i=1;i<=n;i++){
f>>v[i];
st=max(st,v[i]);
}
while(st<=dr){
mij=(st+dr)/2;
if(check(mij)){
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
g<<sol<<'\n';
return 0;
}