Elementarna nepogoda (S)

// dragutinmajranovic
#include <iostream>
using namespace std;
main()
{
      int n, a[100], t;
      string grad[100], k;

      cin >> n;

      for (int i=0; i<n; i++)
      cin >> grad[i] >> a[i];

      for (int i=n-2; i>=0; i--)
      for (int j=0; j<=i; j++)
      if (a[j]<a[j+1])
      {
                 t = a[j];
                 a[j] = a[j+1];
                 a[j+1] = t;
                 k = grad[j];
                 grad[j] = grad[j+1];
                 grad[j+1] = k;
      }

      for (int i=0; i<n; i++)
      for (int j=0; j<n-1; j++)
      if (a[j]==a[j+1] && grad[j]>grad[j+1])
      {
                 t = a[j];
                 a[j] = a[j+1];
                 a[j+1] = t;
                 k = grad[j];
                 grad[j] = grad[j+1];
                 grad[j+1] = k;
      }

      for (int i=0; i<n; i++)
      cout << grad[i] << " " << a[i] << endl;

      system("PAUSE");
}