Cod sursa(job #3280961)
| Utilizator | Data | 27 februarie 2025 21:49:09 | |
|---|---|---|---|
| Problema | Transport | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[10001];
signed main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>v[i];
int pas=1<<15;
int val=0;
while(pas)
{
int bro=pas+val;
int cnt=1;
int s=0;
for(int i=1;i<=n;i++)
{
if(s+v[i]>bro)
{
cnt++;
s=v[i];
}
else
s+=v[i];
}
if(cnt>k)
val+=pas;
pas/=2;
}
cout<<val+1;
return 0;
}
