UVA 11020 Efficient Solutions(BST multiset实现)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
struct Point{
    int a,b;
    bool operator < (const Point &rhs) const {
        return a<rhs.a||(a==rhs.a&&b<rhs.b);
    }
};
multiset<Point> s;
multiset<Point>::iterator it;
#define ss(x) scanf("%d",&x)
int main()
{
    int t,kase=0;
    ss(t);
    while(t--)
    {
        s.clear();
        if(kase++>0) printf("\n");
        printf("Case #%d:\n",kase);
        int q;
        scanf("%d",&q);
        while(q--)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            Point p=(Point){a,b};
            it=s.lower_bound(p);
            if(it==s.begin()||(--it)->b>b)
            {
                s.insert(p);
                it=s.upper_bound(p);
                while(it!=s.end()&&it->b>=b) s.erase(it++);
            }
            cout<<s.size()<<endl;
        }
    }
    return 0;
}