Pagini recente » Cod sursa (job #3176149) | Cod sursa (job #1794357) | Cod sursa (job #1715441) | Cod sursa (job #1499969) | Cod sursa (job #2869301)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
long long n,k,x;
vector <long long>v;
int main()
{
cin>>n>>k;
cin>>x,v.push_back(x);
for(long long i=1; i<n; i++)
cin>>x,v.push_back(x);
long long l=-(1<<30),r=(1<<30),cnt;
while(l<r)
{
long long mid=(l+r)/2;
long long sum=0;
cnt=0;
for(long long i=0; i<v.size()&&cnt<=k; i++)
{
if(sum+v[i]<=mid)
{
sum+=v[i];
}
else
{
sum=v[i];
cnt++;
}
}
cnt++;
if(cnt<=k)
r=mid;
else
l=mid+1;
}
cout<<l;
return 0;
}