Climbing the Leaderboard

                            Solution in C :

python 3  :

#!/bin/python3

import sys
import bisect


n = int(input().strip())
scores = [int(scores_temp) for scores_temp in input().strip().split(' ')]
m = int(input().strip())
alice = [int(alice_temp) for alice_temp in input().strip().split(' ')]
# your code goes here

scores = list(sorted(set(scores)))
#print('scores=%s' % scores, file = sys.stderr)
#print('alice=%s' % alice, file = sys.stderr)
aa = [bisect.bisect_right(scores, a) for a in alice]
#print('aa=%s' % aa, file = sys.stderr)
for a in aa:
    v = len(scores) + 1 - a
    print(v)









Java  :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        Stack<Integer> scores = new Stack<>();
        scores.push(in.nextInt());
        for (int i = 1; i < n; i++) {
            int cur = in.nextInt();
            if (!scores.peek().equals(cur)) scores.push(cur);
        }
        int m = in.nextInt();
        for (int i = 0; i < m; i++) {
            int cur = in.nextInt();
            while (scores.size() > 0 && cur > scores.peek()) scores.pop();
            System.out.println(scores.size() +(scores.size() > 0 && scores.peek().equals(cur) ? 0 : 1));
        }
    }
}










C++  :

#include <ios>
#include <iostream>
#include <vector>
#include <algorithm>

std::vector<int> vec;

int main()
{
    int n, q, v;
    std::cin >> n;
    for (int i = 0; i < n; i++)
    {
        std::cin >> v;
        vec.push_back(v);
    }
    std::sort(vec.begin(), vec.end());
    vec.resize(std::distance(vec.begin(), std::unique(vec.begin(), vec.end())));
    std::cin >> q;
    while (q--)
    {
        std::cin >> v;
        std::cout << std::distance(std::upper_bound(vec.begin(), vec.end(), v), vec.end())+1 << '\n';
    }
}










C  :

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(){
    int n; 
    scanf("%d",&n);
    int *scores = malloc(sizeof(int) * n);
    for(int scores_i = 0; scores_i < n; scores_i++){
       scanf("%d",&scores[scores_i]);
        if(scores_i){
            if(scores[scores_i]==scores[scores_i-1]){
                scores_i--;
                n--;
            }
        }
    }
    //printf("%d\n",n);//
    int m; 
    scanf("%d",&m);
    int *alice = malloc(sizeof(int) * m);
    for(int alice_i = 0; alice_i < m; alice_i++){
       scanf("%d",&alice[alice_i]);
    }
    int rank=n;
    for(int j=0; j<m; j++){
        while(alice[j]>=scores[rank-1] && rank>0){
            rank--;
            if(rank==0) break;
        }
        printf("%d\n",rank+1);
    }
    
    
    // your code goes here
    return 0;
}