Mai intai trebuie sa te autentifici.
Cod sursa(job #2804003)
| Utilizator | Data | 20 noiembrie 2021 18:08:18 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16001],T,C,maxim;
int main()
{
fin >> n >> k;
for(int i=1;i<=n;i++)
{
fin >> v[i];
T+=v[i];
maxim=max(maxim,v[i]);
}
int st=maxim,dr=T;
while(st<dr)
{
C=(st+dr)/2;
int crt=1,s=0;
for(int i=1;i<=n;i++)
{
s+=v[i];
if(s>C)
{
crt++;
s=v[i];
}
}
if(crt<=k)
dr=C;
else st=C+1;
}
fout << dr;
return 0;
}
