#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <stack>
#include <queue>
using std::pair;
using std::vector;
using std::sort;
using std::endl;
using std::cout;
// bool cmp(const pair<int, int>& p1, const pair<int, int>& p2)
// {
// return p1.second < p2.second;
// }
class test
{
public:
static bool cmp(const pair<int, int>& p1, const pair<int, int>& p2)
{
return p1.second < p2.second;
}
void my_sort(vector <pair<int, int>> &data)
{
sort(data.begin(), data.end(), test::cmp);
}
};
int main()
{
vector <pair<int, int>> data;
for(int i=10; i>=0; i--)
{
data.push_back(pair<int, int>(10-i, i));
}
test a;
a.my_sort(data);
// sort(data.begin(), data.end(), cmp);
for (auto &&i : data)
{
cout << i.first << '\t' << i.second << endl;
}
return 0;
}
