C++ :

#include<iostream>
#include<algorithm>

using namespace std;
unsigned long long s[200010];
int main()
{
	unsigned long long n,num=1,flag;
	cin>>n;
	for(unsigned long long i=1;i<=n;++i)
	cin>>s[i];
	sort(s+1,s+n+1);
	
	for(unsigned long long i=2;i<=n;++i)
	if(s[i]!=s[i-1])
	flag=s[i];		
	for(unsigned long long i=1;i<=n;++i)
	{
		if(s[i]!=s[i+1])
		{
			cout<<s[i]<<" "<<num;
			if(s[i]!=flag)
			cout<<endl;
			num=1;
		}
		else	num++;
	}
	
	return 0;
}

Pascal :

var
   i,n,ans,x:longint;
   a:array[0..1000000]of longint;
procedure qsort(l,r:longint);
var
   i,j,mid,t:longint;
begin
 i:=l;j:=r;
 mid:=a[(i+j)div 2];
 while i<=j do
  begin
   while a[i]<mid do inc(i);
   while a[j]>mid do dec(j);
   if i<=j then
    begin
     t:=a[i];a[i]:=a[j];a[j]:=t;
     inc(i);dec(j);
    end;
  end;
 if l<j then qsort(l,j);
 if i<r then qsort(i,r);
end;
begin
 readln(n);
 for i:=1 to n do readln(a[i]);
 qsort(1,n);
 ans:=0;
 for i:=1 to n do if a[i]=a[1] then inc(ans) else break;
 x:=i;
 writeln(a[1], ' ',ans);
 ans:=1;
 for i:=x+1 to n do if a[i]=a[i-1] then inc(ans) else
  begin
   writeln(a[i-1],' ',ans);
   ans:=1;
  end;
 if a[n]<>a[1]then writeln(a[n],' ',ans);
end.