Algorithm, c++, Sort

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
 
using namespace std;
 
bool compare(pair<int, pair<string, int>> v1, pair<int, pair<string, int>> v2) {
    if (v1.second.second != v2.second.second) {
        return v1.second.second > v2.second.second;
    }
    else {
        return v1.first < v2.first;
    }
}
 
int main() {
    vector<pair<int, pair<string, int>>> v;
 
 
    for (int i = 0; i < 5; i++) {
        string name;
        int score;
        cin >> name >> score;
        v.push_back(pair<int, pair<string, int>>(i, make_pair(name, score)));
    }
 
    sort(v.begin(), v.end(), compare);
 
    for (int i = 0; i < v.size(); i++) {
        cout << v[i].second.first << endl;
    }
}