//ÍøÉϵÄÌ°ÐÄËã·¨ºÃÉñ°¡¡£¡£¡£ÎÒÖ»»áÓÃ×îС·ÑÓÃ×î´óÁ÷ÅÜTAT

#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

#include<queue>

using namespace std;

#define rep(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

int read(){

	int x=0;char c=getchar();

	while(!isdigit(c)) c=getchar();

	while(isdigit(c)) x=x*10+c-'0',c=getchar();

	return x;

}

priority_queue<int>q;

const int nmax=5e4+5;

const int inf=0x7f7f7f7f;

int a[nmax];char s[nmax];

int main(){

	scanf("%s",s+1);

	int n=strlen(s+1),u,v,cnt=0;long long sm=0;

	rep(i,1,n) if(s[i]=='?') u=read(),v=read(),sm+=v,a[i]=v-u;

	rep(i,1,n){

		if(s[i]=='(') ++cnt;else --cnt;

		if(s[i]=='?') q.push(a[i]);

		if(cnt<0) {

			if(q.empty()) {

				puts("-1");return 0;

			}else sm-=q.top(),q.pop(),cnt+=2;

		}

	}

	if(cnt) puts("-1");

	else printf("%lld\n",sm);

	return 0;

}