Submission #5829484

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n;
	cin >> n;
	map<pair<string, int>, int> A;
	string s;
	int num;

	for(int i=0; i<n; ++i){
		cin >> s >> num;
		//A.insert(make_pair(make_pair(s, 100-num),i+1));
		A.insert({{s, -num},i+1});
	}
	//sort(A.begin(),A.end());
	for(auto it=A.begin(); it!=A.end(); it++){
		cout << (*it).second << endl;
	}
	
	return 0;
}

Submission Info

Judge Result