【pb_ds】bzoj1056 [HAOI2008]排名系统/bzoj1862 [Zjoi2006]GameZ游戏排名系统

STL裸题，线下AC，bzoj无限RE ing……

 #include<cstdio>
 #include<cctype>
 #include<iostream>
 #include<string>
 #include<ext/pb_ds/assoc_container.hpp>
 #include<ext/pb_ds/tree_policy.hpp>
 using namespace std;
 using namespace __gnu_cxx;
 using namespace __gnu_pbds;
 int Res,Num;char C,CH[];
 inline int G()
 {
     Res=;C='*';
     while(C<''||C>'')C=getchar();
     while(C>=''&&C<=''){Res=Res*+(C-'');C=getchar();}
     return Res;
 }
 inline void P(int x)
 {
     Num=;if(!x){putchar('');puts("");return;}
     while(x>)CH[++Num]=x%,x/=;
     while(Num)putchar(CH[Num--]+);
     puts("");
 }
 int n,v,en;
 string s;
 struct Point
 {string x;int y,z;
 Point(const string &a,const int &b,const int &c){x=a;y=b;z=c;}
 Point(){}};
 bool operator < (const Point &a,const Point &b){return a.y!=b.y ? a.y<b.y : a.z>b.z;}
 tree<Point,null_type,less<Point>,rb_tree_tag,tree_order_statistics_node_update> T;//在bzoj上请将null_type改成null_mapped_type
 typedef tree<Point,null_type,less<Point>,rb_tree_tag,tree_order_statistics_node_update>::iterator ITER;
 map<string,int>ma,ma2;
 inline bool is_name(const string &x)
 {
     int len=x.length();
     for(int i=;i<len;i++) if(!isalpha(x[i])) return false;
     return true;
 }
 inline int to_num(const string &x)
 {
     int res=,base=,len=x.length();
     for(int i=len-;i>=;i--)
       {
           res+=(x[i]-'')*base;
           base*=;
       }
     return res;
 }
 int main()
 {
     n=G();
     for(int i=;i<=n;i++)
       {
           cin>>s;
           if(s[]=='+')
             {
                 s.erase(,);
                 v=G();
                 if(ma.find(s)!=ma.end()) T.erase(T.find(Point(s,ma[s],ma2[s])));
             ma[s]=v;
             T.insert(Point(s,v,++en));
             ma2[s]=en;
             }
           else
             {
                 s.erase(,);
                 if(is_name(s)) P(T.size()-T.order_of_key(Point(s,ma[s],ma2[s])));
                 else
                   {
                       v=to_num(s);
                       int i=; ITER it=T.find_by_order(T.size()-v);
                       for(;;it--,i++)
                         {
                             printf("%s",(*it).x.c_str());
                             if(it==T.begin()||i==)
                       {
                           puts("");
                           break;
                       }
                     putchar(' ');
                         }
                   }
             }
       }
     return ;
 }