C++ :

#include<bits/stdc++.h>
using namespace std;
int main(){
   int i,n,a[100],x,t,j;
   cin>>n;
   for(i = 0;i < n;i++){
   	cin>>a[i];
   }
   cin>>x;
   for(i = 1;i < n - 1;i++){
      for(j = 0;j <= n - i - 1;j++){
      	if(a[j] < a[j+1]){
      		t = a[j];
      		a[j] = a[j+1];
      		a[j+1] = t;
		  }
	  }
   }
   for(i = 0;i < n;i++){
   	if(a[i] == x){
   		cout<<i + 1;
   		break;
	   }
   }
   return 0; 
}

Pascal :

var a:array[1..100000] of longint;
   b,c,i,s:longint;
begin
read(b);
for i:=1 to b do
read(a[i]);
read(c);
for i:=1 to b do
if a[i]>c then inc(s);
write(s+1);
end.

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		for(int i =0;i<n;i++){
			a[i] = sc.nextInt();
		}
		int x = sc.nextInt();
		getNum(a,x);

	}
	public static void getNum(int[] a,int x){
		int t ;int index = 0;
		for(int i = 1;i<a.length;i++){
			for(int j = 0;j<a.length-i;j++){
				if(a[j]<a[j+1]){
					t = a[j+1];
					a[j+1] = a[j ];
					a[j] = t;
				}
			}
			
		}
		for(int i = 0;i<a.length;i++){
			if(a[i] == x){
				index =i+1;
				System.out.println(index);
				break;
			}
		}
	}

}

Python :

n=int(input())
a=input().split()
a=list(map(int,a))
x=int(input())
a=sorted(a)
a.reverse()
m=a.index(x)
print(m+1)