Pagini recente » Cod sursa (job #2233533) | Cod sursa (job #968313) | Cod sursa (job #412068) | Cod sursa (job #329841) | Cod sursa (job #1712911)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[1000],t,n;
bool verif(int k)
{
int nr=0,c=0,i;
for(i=1; i<=n; i++)
{
if(v[i]>c)
{
nr++;
c=k;
}
if(v[i]>c) return false;
c-=v[i];
}
return (nr<=t);
}
int main()
{
int maxim=0;
in>>n>>t;
for(int i=1; i<=n; i++)
{
in>>v[i];
if(v[i]>maxim) maxim=v[i];
}
while(verif(maxim)==true) maxim--;
out<<maxim+1;
return 0;
}