pipioj 1452: 括号匹配Ⅱ（贪心）

#define bug(x) cout<<#x<<" is "<<x<<endl
#define IO std::ios::sync_with_stdio(0)
#include <bits/stdc++.h>
using namespace  std;
typedef long long ll;
#define mk make_pair
#define pb push_back
const int inf=2147483647;
const int N=1e5+10;
int n,m;

char s[N];

priority_queue<ll>q;

int main(){

    scanf("%s",s+1);
    n=strlen(s+1);
    int k=0;
    ll ans=0;
    for(int i=1;i<=n;i++){
        if(s[i]=='(')k++;
        else if(s[i]==')'){
            k--;
            if(k<0){
                if(q.empty()){
                    printf("-1
");
                    return 0;
                }
                else{
                    ans-=q.top();
                    q.pop();
                    k+=2;
                }
            }
        }
        else{
            ll x,y;
            scanf("%lld%lld",&x,&y);
            if(k>0){
                k--;
                ans+=y;
                q.push(y-x);
            }
            else if(!q.empty()&&q.top()>y-x){
                k++;
                ans-=q.top();
                q.pop();
                ans+=y;
                q.push(y-x);
            }
            else{
                k++;
                ans+=x;
            }
        }
    }
    if(k)ans=-1;
    printf("%lld
",ans);
}