Advertisement
Morass

pair sorting

Feb 24th, 2016
111
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.20 KB | None | 0 0
  1. typedef pair<string,int> si;
  2. #define aa first
  3. #define bb second
  4. si A[MX];
  5. bool cp(si a,si b){
  6.     return a.bb!=b.bb?a.aa<b.aa:a.bb<b.bb;
  7. }
  8. int main(void){
  9.     sort(A,A+N,cp);
  10.     return 0;
  11. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement