Shoemaker's Problem

最新推荐文章于 2019-01-21 10:32:07 发布

蚕豆儿

最新推荐文章于 2019-01-21 10:32:07 发布

阅读量855

点赞数

分类专栏：贪心文章标签： C++ ACM 贪心

本文链接：https://blog.csdn.net/candouer/article/details/11554457

版权

贪心专栏收录该内容

10 篇文章 0 订阅

订阅专栏

http://www.bnuoj.com/bnuoj/problem_show.php?pid=18444

Shoemaker's Problem

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on UVA. Original ID: 10026
64-bit integer IO format: %lld Java class name: Main

Prev Submit Status Statistics Discuss Next

Font Size:

Type:

[PDF Link]

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

这个题被坑了，交第一次WA，发现好像是格式输出错误。少了一个换行，为毛线给我来个WA！！！擦！

AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>

using namespace std;

struct node
{
    int nu;
    int a,b;
    double su;
};

bool cmp(node a, node b)
{
    if(a.su==b.su)
    {
        return a.nu<b.nu;
    }
    return a.su>b.su;
}

int main()
{
    int t,n,i;
    node k[1001];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i = 0; i < n; i++)
        {
            k[i].nu = i+1;
            scanf("%d%d",&k[i].a,&k[i].b);
            k[i].su = (double)k[i].b/k[i].a;
        }
        sort(k,k+n,cmp);
        printf("%d",k[0].nu);
        for(i = 1; i < n; i++)
        {
            printf(" %d",k[i].nu);
        }
        printf("\n");
        if(t!=0)
        {
            printf("\n");
        }
    }

    return 0;
}

蚕豆儿

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Shoemaker's Problem

http://www.bnuoj.com/bnuoj/problem_show.php?pid=18444Shoemaker's ProblemTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVA. Original ID: 1002664-bit int
复制链接

扫一扫