Submission #31668379

---

Source Code Expand

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

#define ll                      long long
#define sz(x)                   (int)((x).size())
#define all(a)                  a.begin(), a.end()
#define flush                   fflush(stdout)
#define endl                    '\n' 
#define INF                     2000000000000000



template <typename T, typename U>static inline void amin(T &x, U y){if (y < x) x = y;}
template <typename T, typename U>static inline void amax(T &x, U y){if (x < y)x = y;}
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }


ll gcd(ll a, ll b)
{if (b == 0)
           return (a);
    else
         return (gcd(b, a % b));
}

 
//#define runSieve 
vector<bool> prime(10000005, true); 
void sieve(ll n = 10000002){
prime[1] = false;
for (ll p = 2; p * p <= n; p++)
     {if (prime[p] == true)
             for (ll i = p * p; i <= n; i += p) 
                    prime[i] = false; 
      }
}
 
//******************************************************************************************************************


void fn()
{
     int n;
     cin>>n;
     map<string,pair<int,int> >M;
     for(int i=0;i<n;i++){
      string s;
      cin>>s;
      ll  num;
      cin>>num;
      if(!M.empty() and M.find(s)==M.end()){
        M[s]={num,i+1};
      }else if(M.empty()){
        M[s]={num,i+1};
      }
     }
     ll A=0;
     int idx=-1;
     for(auto x:M){
      if(x.second.first>A){
        idx=x.second.second;
        A=x.second.first;
      }
     }
  cout<<idx;
}

int main()
{
     ios_base::sync_with_stdio(0);
    cin.tie(0);
   cout.tie(0);
#ifdef runSieve
     sieve();
#endif
#ifdef NCR
     initialize();
#endif
   ll TESTS = 1;
   //cin >> TESTS;
   for(int t=1;t<=TESTS;t++){
   //cout<<"Case #"<<t<<": ";
   fn();
   }
   return 0;    
}

Submission Info

Judge Result