uva10026 - Shoemaker's Problem

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 1005;
struct shoe{
int id;
double p;
} a
;
int cmp(shoe x, shoe y) {
return x.p > y.p;
}
int main() {
int cas;
scanf("%d", &cas);
while (cas--) {
int n;
scanf("%d", &n);
int t, s;
for (int i = 0; i < n; i++) {
scanf("%d%d", &t, &s);
a[i].p = s*(1.0) / t;
a[i].id = i + 1;
}
sort(a, a + n,cmp);
printf("%d", a[0].id);
for (int i = 1; i < n; i ++)
printf(" %d", a[i].id);
printf("\n");
if(cas)
printf("\n");
}
return 0;
}