C++ :

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<iostream>
using namespace std;
struct xuhao
{
    int a;
    string b;
}c[1000];
int compare(xuhao x,xuhao y)
{
    return x.a<y.a;
}
int main()
{
    int n,i;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        cin>>c[i].a>>c[i].b;
    }
    sort(c,c+n,compare);
    for(i=0;i<n;i++)
    {
        cout<<c[i].b<<endl;;
    }
}

Pascal :

var
  s,tmp:string;
  i,j,n:longint;
  f:array[1..1000] of longint;
  s1:array[1..1000] of string;
begin
  readln(n);
  for i:=1 to n do
    begin
      readln(s);
      tmp:=copy(s,1,pos(' ',s)-1);
      val(tmp,f[i]);
      s1[i]:=copy(s,pos(' ',s)+1,length(s)-pos(' ',s));
    end;
  for i:=1 to 1000 do
    for j:=1 to 1000 do
      if f[j]=i then writeln(s1[j]);
end.