Submission #1973011

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;
typedef long long ll;
const ll INF=10000000000000000LL;

int main() {
	int n;
	string s;
	cin>>n>>s;
	string s2=s;
	int h1=0,h2=0,h3=0;
	for(int i=0;i<n;++i){
		if(s[i]=='(')++h1;
		if(s[i]==')'){
			++h2;
			if(h1<h2)h3=max(h2-h1,h3);
		}
	}
	for(int i=0;i<h3;++i)s2='('+s2;
	for(int i=0;i<h1-h2+h3;++i)s2=s2+')';
	cout<<s2<<endl;
	return 0;
}

Submission Info

Judge Result