pair与排序

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <queue>
#include <stack>
#include <utility>
using namespace std;

pair<int,int> A[200];
int main()
{
    for(int i=0;i<100;i++)
    {
        A[i] = pair<int, int> (100-i,i);
    }
    for (int i=50; i<100; i++)
    {
        A[i] = make_pair(i, i);
    }
    sort (A, A+100);
    for (int i=0; i<100; i++)
    {
        cout << A[i].first << " " << A[i].second ;
        puts("");
    }
    cout << endl;
    return 0;
}

大神教我用stl啦~\(≧▽≦)/~啦啦啦~~