C++ :

#include<bits/stdc++.h>
using namespace std;
int n;
int a[105],ss,s;
int cmp(int x,int y)
{
	return x>y;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	cin>>ss;
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++)
	{
		s++;
		if(a[i]==ss)
		{
			cout<<s<<endl;
			break;
		}
	}
   return 0;
}

Pascal :

var
 n,i,b,p,m:integer;
 a:array[1..1000] of integer;
begin
 readln(n);
 for i:=1 to n do read(a[i]);
 readln(m);
  p:=1;
 for i:=1 to n do
   if m<a[i] then p:=p+1;
write(p);
end.