[贪心]Shoemaker's Problem uva10026

最新推荐文章于 2019-04-02 22:16:17 发布

Eureka_Yi

最新推荐文章于 2019-04-02 22:16:17 发布

阅读量1.2k

点赞数

分类专栏：算法竞赛入门经典算法竞赛文章标签：贪心

本文链接：https://blog.csdn.net/zju_ziqin/article/details/19570305

版权

算法竞赛入门经典同时被 2 个专栏收录

117 篇文章 1 订阅

订阅专栏

算法竞赛

108 篇文章 13 订阅

订阅专栏

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

Sample Output

2 1 3 4

Alex Gevak
September 16, 2000(Revised 4-10-00, Antonio Sanchez)

题意：

鞋匠有N件工作要完成。他每天只能做一件工作。并且他知道这些工作分别要几个工作天才能完成。另外，他也知道每个工作被延误一天所需被罚的罚金。延误的天数为从今天算起到该工作开始的那天（所以只有第一件工作没有罚金）。

以第一组测试资料为例说明：若工作的顺序是1 2 3 4，那罚金为：0*4+1000*3+4*2+6*5=3038。若工作的顺序是2 1 3 4，则罚金为：0*1000+1*4+4*2+6*5=42。所以第二种工作顺序的罚金较少（事实上也是最少）。

你的任务是写一个程式帮助鞋匠找出完成这N个工作的先后顺序，使得罚金最少。

解法：很明显的一道贪心的题目，找到最佳方案。

#include<iostream>
#include<algorithm>

using namespace std;

class node
{
public:
    int time,val,num;
    double ave;
}work[1010];

bool cmp(node x,node y)
{
    if(x.ave!=y.ave) return x.ave>y.ave;
    else return x.num<y.num;
}

int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        int m;
        cin>>m;
        for(int i=0;i<m;i++)
        {
            cin>>work[i].time>>work[i].val;
            work[i].num=i+1;
            work[i].ave=(work[i].val*1.0)/work[i].time;
        }
        sort(work,work+m,cmp);
        cout<<work[0].num;
        for(int i=1;i<m;i++)
            cout<<" "<<work[i].num;
        cout<<endl;
        if(n) cout<<endl;
    }
    return 0;
}