Cod sursa(job #3124258)
Utilizator | Data | 27 aprilie 2023 15:49:49 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
using namespace std;
int v[16000];
int main()
{
int cutie=0,n,k,maxim=0,ok=0,s=0;
int long long suma=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>v[i];
suma=suma+v[i];
if(v[i]>maxim)
{
maxim=v[i];
}
}
for(int p=maxim;p<=suma;p++)
{
for(int i=1;i<=n;i++)
{
if(s+v[i]>=p)
{
s=0;
s=s+v[i];
cutie++;
}
}
if(cutie+1==k)
{
cout<<p;
break;
}
cutie=0;
}
return 0;
}