Submission #1866440

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
#define ll long long

const int INF = 1e9;
const long long LLINF = 1e18;

using namespace std;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};
int dy8[] = {0,1,1,1,0,-1,-1,-1};
int dx8[] = {1,1,0,-1,-1,-1,0,1};

/*==================================================*/
/*variable*/
string OP;
vector<int> cnt;
/*==================================================*/
/*function*/

/*==================================================*/

int main() {
    cin>>OP;
    int t = 0;
    RREP(i,0,OP.size()){
        if(OP[i] == '+') t++;
        else if(OP[i] == '-') t--;
        else cnt.push_back(t);
    }

    sort(cnt.begin(), cnt.end());
    int ans = 0;
    REP(i,0,cnt.size()) {
        if(i < cnt.size()/2) ans -= cnt[i];
        else ans += cnt[i];
    }

    cout<<ans<<endl;

    return 0;
}

Submission Info

Judge Result