Cod sursa(job #3295477)
Utilizator | Data | 5 mai 2025 23:39:18 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
using namespace std;
fstream cin("transport.in");
ofstream cout("transport.out");
int main()
{
int s[16001], gasit=0, n, k, i;
cin>>n>>k;
int vmin=-1;
int vmax=0;
for(int i=1; i<=n; i++)
{
cin>>s[i];
if(s[i]>vmin)
vmin=s[i];
vmax=vmax+s[i];
}
for(i=vmin; i<=256000000 && gasit==0; i++)
{
int c=0;
int d=1;
for(int j=1; j<=n; j++)
{
if(c+s[j]<=i)
c=c+s[j];
else
{
d++;
c=0;
}
}
if(d<=k)
gasit=1;
}
cout<<i;
return 0;
}