vector<int> climbingLeaderboard(vector<int> ranked, vector<int> player) {
    // Removing duplicates
    auto end = unique(ranked.begin(), ranked.end());
    
    vector<int> out;
    // Checking lowerbound of elements of player in ranked
    for(auto j:player){
        int i = distance(ranked.begin(), lower_bound(ranked.begin(), end, j,greater<int>()));
        out.push_back(i+1);
    }
    return out;
}