uva-practice/10026.cpp at master · even-wei/uva-practice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include <cstdio>
#include <cstring>

using namespace std;

struct job {
    int    label;
    double price;
};

static inline double cmp(job *x, job *y)
{
    if (x->price == y->price)
        return (double)(y->label - x->label);
    else
        return x->price - y->price;
}

void sortL(job *list, int len)
{
    int i = 0;
    int j = len - 1;
    job pivot, tmpS;

    if (len < 2) return;
    memcpy(&pivot, list + len / 2, sizeof(job));

    while (true) {
        while (cmp(list + i, &pivot) > 0)
            ++i;
        while (cmp(list + j, &pivot) < 0)
            --j;
        if (i >= j) break;

        memcpy(&tmpS, list + i, sizeof(job));
        memcpy(list + i, list + j, sizeof(job));
        memcpy(list + j, &tmpS, sizeof(job));

        i++;
        j--;
    }

    sortL(list, i);
    sortL(list + i, len - i);
}

int main(void)
{
    int times, len, i, elapse, value;
    job list[1000];

    scanf("%d", &times);

    while (times-- > 0) {
        scanf("%d", &len);

        for (i = 0; i < len; ++i) {
            list[i].label = i + 1;
            scanf("%d %d", &elapse, &value);
            list[i].price = 1.0 * value / elapse;
        }

        sortL(list, len);

        printf("%d", list[0].label);
        for (i = 1; i < len; ++i)
            printf(" %d", list[i].label);
        if (times > 0)
            printf("\n\n");
        else
            printf("\n");
    }

    return 0;
}