Pagini recente » Cod sursa (job #469624) | Cod sursa (job #36376) | Cod sursa (job #2947339) | Cod sursa (job #1106429) | Cod sursa (job #2869289)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,k,x;
vector <int>v;
int main()
{
cin>>n>>k;
cin>>x,v.push_back(x);
for(int i=1; i<n; i++)
cin>>x,v.push_back(x);
int l=0,r=(1<<30),cnt;
while(l<r)
{
int mid=(l+r)/2;
int sum=0;
cnt=0;
for(int 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;
}