UVA 10026

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <stdio.h>
using namespace std;
#define MAXN 1010

struct node
{
     double fan;
     int id;
}task[MAXN];

int cmp( node a, node b)
{
    if(a.fan != b.fan)
     return a.fan > b.fan;
    return a.id < b.id;
}


int main()
{
   int t, n;
   double time, money;
   scanf("%d",&t);
   while(t--)
   {
       scanf("%d",&n);
       for( int i = 0; i < n; i++)
       {
           scanf("%lf %lf",&time, &money);
           task[i].fan = money/time;
           task[i].id = i + 1;
       }
       sort(task, task + n, cmp);
       for( int i = 0; i < n; i++)
        printf("%d%c",task[i].id, i == n -1 ? '\n':' ');
        if(t)
         printf("\n");
   }
}