C++ :

#include<bits/stdc++.h>
using namespace std;
 int a[50005],b[50005],ana=0,sum=0,d=0;
int main(){
   
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        {cin>>a[i];
        }
   for(int i=1;i<=n;i++)
   {
    for(int j=1;j<=n;j++)
    {
        if(a[i]<a[j])
        {
            b[i]++;
           }
       }
      
   }
 for(int i=1;i<=n;i++)
 {
 	cout<<b[i]<<" ";
 }
    return 0;
}

Pascal :

var i,j,k,n,m:longint; s,t:array [1..10000] of longint;
begin
    readln(n);
    for i:=1 to n do read(s[i]);
    for i:=1 to n do
    begin
        k:=0;
        for j:=1 to n do if s[i]<s[j] then  k:=k+1;
        t[i]:=k;
    end;
    if n<>0 then write(t[1]);
    for i:=2 to n do write(' ',t[i]);
end.