Submission #5913307

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

int main(){
    int N,K;
    cin>>N>>K;
    vector<int> V(N);
    rep(i,N){cin>>V[i];}

    int res = 0;
    for(int i=0;i<=K;i++){
            for(int j=0;j<=K-i;j++){
                if(i+j>N)continue;
                int d = K - i - j;
                vector<int> t;
                int score = 0;
                for(int k=0;k<i;k++){
                    score += V[k];
                    t.push_back(V[k]);
                }
                for(int k=N-j;k<N;k++){
                    score+=V[k];
                    t.push_back(V[k]);
                }
                sort(t.begin(),t.end());

                for(int l=0;l<d;l++){
                    if(l>=t.size())break;
                    if(t[l]>0)break;
                    score-=t[l];
                }
                res = max(res,score);
        }
    }
    cout<<res;
}

Submission Info

Judge Result