Cod sursa(job #2988787)
Utilizator | Peter Robert robert111 | Data | 5 martie 2023 14:38:18 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.75 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16005],n,k;
bool verif(int a)
{
int s=0,cnt=1;
for(int i=0;i<n;i++)
{
s+=v[i];
if(s>a)
{
s=v[i];
cnt++;
}
}
if(cnt<=k)return 1;
else
return 0;
}
int main()
{
int st=0,dr=256000000,rez=-1;
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>v[i];
if(st<v[i])
st=v[i];
}
while(st<=dr)
{
int m=(st+dr)/2;
int m1=verif(m);
if(m1==1)
{
dr=m-1;
rez=m;
}
else
st=m+1;
}
cout<<rez;
return 0;
}