C :

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>
int main()
{
   // freopen("in","r",stdin);
   // freopen("out","w",stdout);


   int a[50][2];
int n;
int i,j,k;
    while(scanf("%d",&n)!=EOF)
    {



for (i=0;i<n;i++)
scanf("%d%d",&a[i][1],&a[i][2]);

for (i=0;i<n-1;i++)
for (j=0;j<n-1-i;j++)
   if (a[j][2]<a[j+1][2])
{    k=a[j][1];
   a[j][1]=a[j+1][1];
   a[j+1][1]=k;
    k=a[j][2];
  a[j][2]=a[j+1][2];
   a[j+1][2]=k;
}
for (i=0;i<n;i++)
  printf("%d %d\n",a[i][1],a[i][2]);


    }
  return 0;
}

C++ :

#include<stdio.h>
int main()
{
  int a[50][3],n,i,j,t;
  while(scanf("%d",&n)!=EOF)
  {
    for(i=1;i<=n;i++)
		scanf("%d%d",&a[i][1],&a[i][2]);
	for(i=1;i<=n-1;i++)
		for(j=1;j<=n-i;j++)
		  if(a[j][2]<a[j+1][2])
		  {
		    t=a[j][1];
			a[j][1]=a[j+1][1];
			a[j+1][1]=t;

			t=a[j][2];
			a[j][2]=a[j+1][2];
			a[j+1][2]=t;
		  }
		  for(i=1;i<=n;i++)
		printf("%d %d\n",a[i][1],a[i][2]);


  }

  

}

Pascal :

var n,i,j:longint;
    a,b:array[1..100] of longint;

procedure jh(var a,b:longint);
var t:longint;
begin
  t:=a;
  a:=b;
  b:=t;
end;

begin
  while not eof do
  begin
    readln(n);
    fillchar(a,sizeof(a),0);
    fillchar(b,sizeof(b),0);
    for i:=1 to n do
      readln(b[i],a[i]);
    for i:=1 to n do
      for j:=1 to n-i do
        if (a[j]<a[j+1])or
           (a[j]=a[j+1])and(b[j]>b[j+1]) then
        begin
          jh(a[j],a[j+1]);
          jh(b[j],b[j+1]);
        end;
    for i:=1 to n do
      writeln(b[i],' ',a[i]);
  end;
end.