Cod sursa(job #3156122)
Utilizator | Data | 10 octombrie 2023 17:09:45 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream F("transport.in");
ofstream G("transport.out");
int n,j,c,d,s,e,a,b,k,i,v[16001];
int main()
{
for(F>>n>>k,i=1;i<=n;++i) {
F>>v[i],b+=v[i];
if(v[i]>a)
a=v[i];
}
for(;a!=b&&a+1!=b;) {
for(d=b-a+1,s=a+d/2,e=0,i=1;i<=n;++e)
for(j=0;j+v[i]<s;) {
j+=v[i],++i;
if(i==n+1)
j=s+1;
}
e>k?a=s:b=s;
}
G<<a;
return 0;
}