UVA 10026 Shoemaker's Problem (贪心)

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

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

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

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

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

题意：鞋匠有n个任务。每个任务有一个完成所需时间day。和每过一天要陪的钱数value。。要求一个顺序使得赔钱最少。

思路：很明显要用贪心。。贪心的策略是第i，j个任务，如果valuei * dayj > vauej * dayi，说明先修j赔款大于先修i，所以应该先修i。。所以只要把序列按这个策略排序即可。。

这里有一个注意点。。就是要输出的是字典序最小的 所以在排序的时候如果相同。那么就按任务编号从小到大排序即可。。

代码:

#include <stdio.h>
#include <algorithm>
using namespace std;

int t, n;
struct Shose {
    int day;
    int value;
    int num;
} s[1005];

int cmp(Shose a, Shose b) {
    if (a.value * b.day != b.value * a.day)
	return a.value * b.day > b.value * a.day;
    return a.num < b.num;
}
int main() {
    scanf("%d", &t);
    while (t --) {
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++) {
	    scanf("%d%d", &s[i].day, &s[i].value);
	    s[i].num = i;
	}
	sort(s + 1, s + n + 1, cmp);
	for (int i = 1; i < n; i ++)
	    printf("%d ", s[i].num);
	printf("%d\n", s[n].num);
	if (t) printf("\n");
    }
    return 0;
}