Shoemaker's Problem

Shoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each i_th job, it is known the integer T_i (1<=T_i<=1000), the time in days it takes the shoemaker to finish the job. For each day of delay before starting to work for the i_th job, shoemaker must pay a fine of S_i (1<=S_i<=10000) cents. Your task is to help the shoemaker, writing a programm to find the sequence of jobs with minimal total fine.

The Input

First line of input contains an integer N (1<=N<=1000). The next N lines each contain two numbers: the time and fine of each task in order.

The Output

You programm should print the sequence of jobs with minimal fine. Each job should be represented by its number in input. All integers should be placed on only one output line and separated by one space. If multiple solutions are possible, print the first lexicographically.

Sample Input

1

4
3 4
1 1000
2 2
5 5

Sample Output

2 1 3 4

 
#include <stdio.h>
#include <stdlib.h>
struct work {
    int s, t, v;
};
int cmp(const void *i, const void *j) {
    work *a, *b;
    a = (work *)i, b = (work *)j;
    if(a->t*b->s != b->t*a->s)
        return a->t*b->s - b->t*a->s;
    return a->v - b->v;
}
int main() {
    int t, i, n;
    work D[1001];
    scanf("%d", &t);
    while(t--) {
        scanf("%d", &n);
        for(i = 0; i < n; i++) {
            scanf("%d %d", &D[i].t, &D[i].s);
            D[i].v = i+1;
        }
        qsort(D, n, sizeof(work), cmp);
        for(i = 0; i < n; i++) {
            if(i)
                putchar(' ');
            printf("%d", D[i].v);
        }
        puts("");
        if(t)
            puts("");
    }
    return 0;
}