코드1 #include using namespace std; int n,age; vector v; string name; bool cmp (tuple a, tuple b) { if(get(a) == get(b)) return get(a) > n; for(int i = 0; i > age >> name; v.push_back({age, name, i}); } sort(v.begin(), v.end(),cmp); // 불안정 정렬 for(int i = 0; i > name; v.push_back({age, name}); } stable_sort..
