贪心
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000 + 7;
int T, n;
struct node {
int fine, time;
double d;
int id;
bool operator<(const node& rhs) const {
if(d != rhs.d) return d > rhs.d;
return id < rhs.id;
}
}str[maxn];
int main() {
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d%d", &str[i].time, &str[i].fine);
str[i].d = (double)str[i].fine / str[i].time;
str[i].id = i + 1;
}
sort(str, str + n);
for(int i = 0; i < n; ++i) {
if(i == 0) printf("%d", str[i].id);
else printf(" %d", str[i].id);
}
printf("\n");
if(T) puts("");
}
return 0;
}