Cod sursa(job #3244378)
| Utilizator | Data | 24 septembrie 2024 17:05:51 | |
|---|---|---|---|
| Problema | Transport | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int n,k,v[16000],max1=1;
int transport (int vol)
{
int s=0,t=0,i;
for (i=0;i<n;i++)
{
if (s+v[i]>=vol)
{
s=0;
t++;
}
s=s+v[i];
}
return t;
}
int main()
{
int i;
cin>>n>>k;
for (i=0;i<n;i++)
{
cin>>v[i];
if (max1<v[i])
max1=v[i];
}
int st=max1,dr=16000*16000,m=(st+dr)/2,poz;
for (i=max1;i<=dr;i++)
{
if (transport(i)<=k)
{
break;
}
}
cout<<i;
return 0;
}
