Cod sursa(job #3295500)
Utilizator | Data | 6 mai 2025 10:12:27 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.82 kb |
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int v[16001];
int main()
{
int n, k, i, vol, maxi=-1, mij, s2=0, cnt=0;
cin>>n>>k;
for(i=1; i<=n; i++)
{
cin>>v[i];
if(v[i]>maxi)
maxi=v[i];
s2=s2+v[i];
}
int st=maxi;
int dr=s2;
int sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
cnt=1;
int s=0;
for(i=1; i<=n; i++)
{
if(s+v[i]<=mij)
s=s+v[i];
else
{
s=v[i];
cnt++;
}
}
if (cnt>k)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
}
cout<<sol;
return 0;
}