tyvj/tyvj1036.pas

   1 var
   2 a:array [0..200000] of longint;
   3 i,n,sum:longint;
   4
   5 procedure qsort(l,r : longint);
   6 var
   7    i,j,m : longint;
   8
   9 begin
  10    i:=l; j:=r;
  11    m:=a[l+random(r-l+1)];
  12    repeat
  13       while a[i]<m do inc(i);
  14       while a[j]>m do dec(j);
  15       if i<=j then
  16       begin
  17          a[0]:=a[i]; a[i]:=a[j]; a[j]:=a[0];
  18          inc(i); dec(j);
  19       end;
  20    until i>j;
  21    if l<j then qsort(l,j);
  22    if r>i then qsort(i,r);
  23 end;
  24
  25 begin
  26    readln(n);
  27    for i:=1 to n do readln(a[i]);
  28    qsort(1,n);
  29    i:=1; sum:=1;
  30    while i<=n do
  31    begin
  32       inc(i);
  33       if a[i]=a[i-1] then inc(sum) else begin writeln(a[i-1],' ',sum); sum:=1; end;
  34    end;
  35 end.