Cod sursa(job #2863632)
Utilizator | Data | 7 martie 2022 00:29:21 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int main()
{
int n,i,k,p,nr,s,gasit,m;
long long u;
cin>>n>>k;
int v[n];
for(i=1;i<=n;i++)
cin>>v[i];
p=1;
u=16000*16000;
//u=100;
gasit=0;
while(p<=u && gasit==0)
{
m=(u+p)/2;
s=0;
nr=0;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(s>=m)
{
nr++;
s=v[i];
}
}
if(nr==k) gasit=m;
else
{
if(nr>k)
p=m+1;
else
u=m-1;
}
}
cout<<gasit;
return 0;
}