def climbingLeaderboard(ranked, player):
    # Write your code here
    rank = []
    for i in range(len(player)):
        ranked.append(player[i])
        transformed = sorted(set(ranked), reverse=True)
        rank.append(transformed.index(player[i]) + 1)
    return rank

public static List<Integer> climbingLeaderboard(List<Integer> ranked, List<Integer> player) {
        List<Integer> scores= new ArrayList<>(player.size());
        ranked= ranked.stream().distinct().sorted().collect(toList());
        for (Integer p : player) {
            int index = Collections.binarySearch(ranked, p);
            if(index<0){
                index+=ranked.size()+2;
            }
            else{
                index= ranked.size()+1 + (-1)*(index+1);
            }
            scores.add(index);
        }
        return scores;

    }

vector<int> climbingLeaderboard(vector<int> ranked, vector<int> player) {
    int n = ranked.size(); int m = player.size();
    
    // Xu ly leaderboard
    
    vector<int> stored;
    for (int i=0; i<n; i++) {
        if (i==0) stored.push_back(ranked[i]);
        else {
            if (ranked[i-1]!=ranked[i]) stored.push_back(ranked[i]);
        }
    }
    
    // Xu ly mang player
    vector<int> res; 
    for (int i=0; i<m; i++) {
        int ans = upper_bound(stored.rbegin(),stored.rend(),player[i]) - stored.rbegin();
        int rank = 1+stored.size() - abs(ans);
        res.push_back(rank);
    }
		
    
    return res;
}

int* climbingLeaderboard(int ranked_count, int* ranked, int player_count, int* player, int* result_count) 
{
   int j=0;
    int rankNoDups[ranked_count];
    for(int i=0;i<ranked_count;++i)     //loop to remove duplication in ranked array
    {
        if(ranked[i]==ranked[i+1])      //look for similar values.
        {
            continue;                   //skip below lines in case of similar values           
        }
        rankNoDups[j]=ranked[i];        //add unique values to rankNoDups array
        j++;    //advance j by one
    }

    int count=1;                          //set count to 1
    *result_count=player_count;       //assign value of player_count to *result_count 
    static int a[100000];              //array to stor 
    for(int k=0;k<player_count;++k)        //5,25,50,120  playerrank
    {    
        for(int i=0;i<j;++i)            //100,50,40,20,10   nodups
        {
            if(rankNoDups[i]<=player[k])
            {
                break;
            }
           count++;
        }
        *(a+k)=count;
       // printf("%d\n",*(a+k));
        count=1;
    }
   //result_count[k]=count;
   //printf(">>>>>>>%d<<<<<<<<",(sizeof(result_count)/sizeof(result_count[0])));
   return a;
}