#include <iostream.h>
#include <fstream.h>
long n;

//const char fin[20] = "st.in";
//      char fout[20] = "st.out";

struct tp_
   {
      long id;
      long w;
   };
tp_ a[1000];
void rf()
   {
  //     ifstream ifs(fin);
  //   cin = ifs;
       cin >> n;
       long i, x, y;
       for (i = 1; i <= n; i++)
      {
        cin >> x >> y;
        a[i].id = x;
        a[i].w = y;
      }
   }

void sort (long l, long r)
   {
       tp_ y;
       long i, j, x;
       i = l;
       j = r;
       x = a[(l + r) / 2].w;
      do
      {
           while (x < a[i].w) i++;
           while (x > a[j].w) j--;
          if (i <= j)
             {
             y = a[i];
             a[i] = a[j];
             a[j] = y;
             i++;
             j--;
             }
      }
      while (i <= j);
      if (l < j) sort (l, j);
      if (i < r) sort (i, r);
    }

void wf()
   {
  //     ofstream ofs(fout);
  //     cout = ofs;
       long i;
       for (i = 1; i <= n;  i++) cout << a[i].id <<" "<<a[i].w<<endl;
   }

int main()
    {
       rf();
      sort(1, n);
       wf();
       return 0;
    }

I also got a wrong answer,but I think that the test is not correct since in the description of the problem nothing is said on how to sort teams who have equal number solved problems.Here's my output and after it you'll see the sample one :
3 5
26 4
22 4
20 3 <= look
16 3 <= here
1 2
11 2
7 1

3 5
26 4
22 4
16 3 <= look
20 3 <= here
1 2
11 2
7 1

And the input is the same,I just pasted in a txt file from the site.

Yes, I don't understand either what if m is equals, on one place in sample first go bigger id, then on other place first is smaller id ?!! I thought then, first we output one which is first readed, but that also isn't rule.

So, is it possible that there is a mistake in sample?

Edited by author 06.05.2005 06:16

I got AC!
I thought that first we output one which is first readed.
It's all right!
Just do it!

Hint.
Bubble sort is a stable sort (that means that two teams with the equal number of solved problems must be listed in the output in the same order as they did in the input)
And quicksort is not a stable sort, so don't use it!

Yes. But there should be said something about IDs in the problem!!!

It's said:
" a program, which generates _exactly_ the same final standings as old software"
So, output of your program must be equal to output of bubble-sort program, and sequence of ID's should be the same.