Balanced Sequence——括号匹配

Problem Description
Chiaki has n strings s1,s2,…,sn consisting of ‘(’ and ‘)’. A string of this type is said to be balanced:

• if it is the empty string
• if A and B are balanced, AB is balanced,
• if A is balanced, (A) is balanced.

Chiaki can reorder the strings and then concatenate them get a new string t. Let f(t) be the length of the longest balanced subsequence (not necessary continuous) of t. Chiaki would like to know the maximum value of f(t) for all possible t.

Input
There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:
The first line contains an integer n (1≤n≤105) – the number of strings.
Each of the next n lines contains a string si (1≤|si|≤105) consisting of (' and)’.
It is guaranteed that the sum of all |si| does not exceeds 5×106.

Output
For each test case, output an integer denoting the answer.

Sample Input
2
1
)()(()(
2
)
)(

Sample Output
4
2
主要是排序时候的问题，结构体的l,r记的是这一串当中无法匹配的(和)，
l有后效性，r没有后效性
在l>=r的时候,如果下一个是r>=l的必然是顺序，
否则就像)))((((和))))(((((，因为l必然比r大，所以只要把r大的排在后面就好了
同理另一种情况就可以得出来了

struct node
{
    int left,right,sum;
    bool operator< (const node& a)const
    {
        if(left>=right)
        {
            if(a.left>=a.right)
                return right<a.right;
            else
                return true;
        }
        else
        {
            if(a.left>=a.right)
                return false;
            else
                return left>a.left;
        }
    }
}a[100005];
char s[100005];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%s",s+1);
            int len=strlen(s+1);
            for(int j=1;j<=len;j++)
            {
                if(s[j]=='(')
                    a[i].left++;
                else
                {
                    if(a[i].left>0)
                        a[i].left--,a[i].sum++;
                    else
                        a[i].right++;
                }
            }
        }
        sort(a+1,a+1+n);
        int ans=0,l=0,r=0;
        for(int i=1;i<=n;i++)
        {
            ans+=a[i].sum;
            r+=a[i].right;
            if(l!=0)
            {
                ans+=min(l,r);
                l-=min(l,r);
            }
            l+=a[i].left;
            r=0;
        }
        printf("%d\n",2*ans);
    }
    return 0;
}