hdu 4268 Alice and Bob

Alice and Bob

Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 5   Accepted Submission(s) : 1

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

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.

Input

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.

Output

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

Sample Input

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

Sample Output

1
2
题意：两组卡片，第一组的某一张卡片的长并且宽大于等于第二组某一张卡片的长和宽（x，y）， 加1；
先sort排序下，利用multiset去存第二组的y，multiset容器可以存相同的元素

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<cmath>
 #include<cstring>
 #include<set>
 #include<map>
 #include<queue>
 #include<vector>
 //#define INF 0x3f3f3f3f
 #define N 100005
 typedef long long ll;
 using namespace std;
 struct node{
     int x;
     int y;
 }a[N],b[N];
 bool cmp(node aa,node bb){
     if(aa.x==bb.x){
         return aa.y<bb.y;
     }
     else
         return aa.x<bb.x;
 }
 int main()
 {
     int t,n;
     scanf("%d",&t);
     int i,j;
     while(t--)
     {
         scanf("%d",&n);
         for(i=;i<n;i++)
             scanf("%d%d",&a[i].x,&a[i].y);
         sort(a,a+n,cmp);
         for(i=;i<n;i++)
             scanf("%d%d",&b[i].x,&b[i].y);
         sort(b,b+n,cmp);
         multiset<ll>st;
         multiset<ll>::iterator it;
         int ans=;
         st.clear();
         j=;
         for(i=;i<n;i++){
             while(a[i].x>=b[j].x&&j<n){
                     st.insert(b[j].y);
                     j++;
             }
             if(st.empty())
                 continue;
             it=st.upper_bound(a[i].y);
             if(it!=st.begin())
             {
                 it--;
                 ans++;
                 st.erase(it);
             }
         }
         printf("%d\n",ans);
     }
 }