This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
#define PB push_back
#define MP make_pair
ll n,m,i,j,ans=1000000007,k,a[105],x[105],p;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=n;i>=n-k+1;i--)
x[i]=1;
for(ll l=1;;l++)
{
m=0;p=0;
for(i=1;i<=n;i++)
{
m=max(m,a[i]);
if(x[i]==1)
{
p+=m;
m=0;
}
}
ans=min(ans,p);
if(!next_permutation(x+1,x+n))
break;
}
cout<<ans<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |