uva 10026 - Shoemaker's Problem

#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<list>
#include<queue>
#include<vector>
#define LL long long
#define inf 0x7fffffff
#define eps 1e-7
#define M 105
#define N 1010
using namespace std;
int m,n,t;
int f[N],ti[N],mo[N];
int cmp(int a,int b)
{
    return ti[a]*mo[b]<ti[b]*mo[a];//注意<
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("ex.in","r",stdin);
#endif
    int ncase=0;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for (int i=0; i<n; ++i )
        {
            f[i]=i;
            scanf("%d%d",&ti[i],&mo[i]);
        }
        sort(f,f+n,cmp);
        for (int i=0; i<n; ++i )
            printf("%d%s",f[i]+1,i==n-1?"\n":" ");
        if(t)
            printf("\n");
    }

    return 0;
}