Pagini recente » Cod sursa (job #380517) | Cod sursa (job #673216) | Cod sursa (job #1953962) | Cod sursa (job #3033190) | Cod sursa (job #2427959)
#include <fstream>
#include <algorithm>
using namespace std;
int k,n;
int v[15001];
ifstream cin ( "transport.in" );
ofstream cout ( "transport.out" );
bool verif(int val)
{
int cnt=0,s=0,i;
for(i=1; i<=n; i++)
{
s+=v[i];
if(s>val)
{
s=v[i];
cnt++;
}
}
if(s!=0)
cnt++;
if(cnt<=k)
return 1;
return 0;
}
void cautbin()
{
int r=0,pas=1<<27;
while(pas)
{
if(verif(r+pas)==0)
r+=pas;
pas/=2;
}
cout << r+1;
}
int main()
{
cin >> n >> k;
for(int i=1; i<=n; i++)
cin>>v[i];
cautbin();
return 0;
}