大致题意是:
有一个鞋匠,共有n个任务,第i个任务开始之前每天需要罚款s[i],
求最小的罚款数。
解题思路:
简单的贪心问题,即时间越早,而罚款数越大则越先修。
按照fine/day排序即可。可以用冒泡法,但不能用选择法排序,
若用快排,需要另加一个数标记位置。
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 ith job, it is known the integer Ti (1<=Ti<=1000), the time in days it takes the shoemaker to finish the job. For each day of delay before starting to work for the ith job, shoemaker must pay a fine of Si (1<=Si<=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
#include<iostream>
#include <cstdio>
#include<algorithm>
#include <cmath>
using namespace std;
struct point
{ int order;
double time;
double cost;
double all;
}a[1010];
bool cmp(point a,point b)
{
if(a.all!=b.all)
return a.all>b.all;
else
return a.order<b.order;
}
int main()
{
int t,n,i,j;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf%lf",&a[i].time,&a[i].cost);
a[i].order=i+1;
a[i].all=a[i].cost/a[i].time;
}
sort(a,a+n,cmp);
printf("%d",a[0].order);
for(i=1;i<n;i++)
printf(" %d",a[i].order);
printf("\n");
if(t)
printf("\n");
}
return 0;
}