Pagini recente » Cod sursa (job #1481988) | Cod sursa (job #1051803) | Cod sursa (job #1481810) | Cod sursa (job #1116454) | Cod sursa (job #2574488)
#include<iostream>
#include<fstream>
#include<climits>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16003];
int main()
{
int n,k,i,maxim=INT_MIN,cate=0,corect=0,suma=0;
fin>>n>>k;
cout<<n<<endl;
for(i=1; i<=n; i++)
{
fin>>v[i];
cout<<v[i]<<" ";
if(maxim<v[i])
{
maxim=v[i];
}
}
cout<<endl<<maxim;
cate=1;
while(corect==0)
{
for(i=1; i<=n; i++)
{
if(cate==k)
{
corect=1;
break;
}
if(suma<=maxim)
{
suma+=v[i];
}
if(suma>maxim)
{
suma=suma-v[i];
cate++;
}
// cout<<v[i]<<" "<<suma<<" ";
if(cate==k)
{
corect=1;
break;
}
else
{
maxim++;
// cout<<endl;
break;
}
}
}
fout<<maxim-1;
}