this solution is still failing for 2 cases

climbingleaderboard.cpp

vector<int> climbingLeaderboard(vector<int> ranked, vector<int> player) {
    
    vector<int> player_ranks;
    set<int> score_cache{ranked.begin(), ranked.end()};
    unordered_map<int, int> dp;
    //int dp[INT16_MAX] = {0}; segmentation fault for some cases
  
    for(auto d : player){
        score_cache.insert(d);
        cout << d << "\n";
        if(dp[d] == 0){
        int dpv = distance( score_cache.find(d), score_cache.end());
        dp[d] = dpv;
         player_ranks.push_back(dpv);   
        }else{
             player_ranks.push_back(dp[d]); 
        }
       
    }
    return player_ranks;
}