Alice and Bob‘s game never ends. Today, they introduce a new game. In this game, both of them have N different rectangular cards respectively. Alice wants to use his cards to cover Bob‘s. The card A can cover the card B if the height of A is not smaller than B and the width of A is not smaller than B. As the best programmer, you are asked to compute the maximal number of Bob‘s cards that Alice can cover.
Please pay attention that each card can be used only once and the cards cannot be rotated.

The first line of the input is a number T (T <= 40) which means the number of test cases. 
For each case, the first line is a number N which means the number of cards that Alice and Bob have respectively. Each of the following N (N <= 100,000) lines contains two integers h (h <= 1,000,000,000) and w (w <= 1,000,000,000) which means the height and width of Alice‘s card, then the following N lines means that of Bob‘s.

For each test case, output an answer using one line which contains just one number.

2
2
1 2
3 4
2 3
4 5
3
2 3
5 7
6 8
4 1
2 5
3 4 

1
2

2012 ACM/ICPC Asia Regional Changchun Online

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<set>
using namespace std;
struct node
{
    int a;
    int b;
};
node q[200110],q1[200110];
__int64 vis[200110];
multiset<int>s;
std::multiset<int>::iterator it;
bool cmp(node a,node b)
{
    if(a.b==b.b)
    {
        return a.a<b.a;
    }
    return a.b<b.b;
}
int main()
{
    int T,n;
    scanf("%d",&T);
    while(T--)
    {
        s.clear();
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d",&q[i].a,&q[i].b);
        }
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d",&q1[i].a,&q1[i].b);
        }
        sort(q+1,q+1+n,cmp);
        sort(q1+1,q1+1+n,cmp);
        int x=1;
        int ans=0;
        memset(vis,0,sizeof(vis));
        for(int i=1; i<=n; i++)
        {
            while(x<=n&&q1[x].b<=q[i].b)
            {
                s.insert(q1[x].a);
                x++;
            }
            if(s.size()==0)
            {
                continue;
            }
            it=s.lower_bound(q[i].a);
            if(*(it)==q[i].a)
            {
                    s.erase(it);
                    ans++;
            }
            else
            {
                if(it!=s.begin())
                {
                    --it;
                    s.erase(it);
                    ans++;

                }
            }

        }
        printf("%d\n",ans);
    }
    return 0;
}