Submission #22653151

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const ll modn = 1000000007;

int main()
{ 
    int n;
    cin >> n;
    map<int, string> m;
    string s;
    int t;
    for (int i = 0; i < n; i++) {
        cin >> s >> t;
        m[t] = s;
    }

    map<int, string>::iterator it = m.end();
    --it;
    cout << (*--it).second << endl;

    return 0;
}

Submission Info

Judge Result