pascal：已知数组中有n个元素，求数组中的所有数据各出现多少次

Program Times;
Var
A:Array[1..200000]Of Longint;
I,J,Temp:Longint;
procedure sort(l,r: longint);
var
i,j,x,y: longint;
begin
i:=l;
j:=r;
x:=a[(l+r) div 2];
repeat
while a<x do
inc(i);
while x<a[j] do
dec(j);
if not(i>j) then
begin
y:=a;
a:=a[j];
a[j]:=y;
inc(i);
j:=j-1;
end;
until i>j;
if l<j then
sort(l,j);
if i<r then
sort(i,r);
end;{快速排序}
{==========Main==========}
Begin
ReadLn(N);
For I:=1 To N Do
Read(A[I]);
Sort(1,N);J:=A[1];
WriteLn;WriteLn(A[1]);Temp:=1;
FOr I:=2 TO N Do
If J<>A[I] THen
Begin J:=A[I];WriteLn(Temp);Write(A[I],' ');Temp:=1;End
WriteLN(Temp);
End.

var
a:array[1..200000]of longint;
i,n,k:longint;
begin
readln(n);
for i:=1 to n do
beign
read(k