BOJ 1576 Job Scheduling

Job Scheduling

Accept:13     Submit:24

Time Limit:1000MS     Memory Limit:65536KB

        

Job Scheduling

Description

We are given independent and indivisible jobs numbered from 1 to N . They should be executed sequentially in any order. The later the execution of a job starts the longer it lasts - precisely, the time of execution of the job i is hi(t)=ai∗t+bi, if we start it in the moment t.

The goal is to schedule the jobs so that the total execution time is the shortest.

Input Format

The first line is the case number T(1≤T≤2000).For each case the first line is the job number N(1≤N≤20).In each of the following N lines there is a pair of nonnegative real numbers.

Output Format

Output the minimal time needed to finish all jobs,in accuracy of two decimal places.

Sample Input

1

5

0.002000 0.003000

0.016000 0.001000

0.100000 0.300000

0.016000 0.005000

0.030000 0.060000

Sample Output

0.38

 

新生排位赛第三场，打得相当的差，一道题都没AC。

这道题是第三场的第一道题，听学长讲完，感觉做不出来真是不应该

题中给出每个任务执行的时间为ai*t+bi，那么给出两个任务(a1,b1),(a2,b2)

      先执行任务1再执行任务2所用时间为：a1*t+b1+a2*(a1*t+b1)+b2=a1*t+b1+a2*a1*t+a2*b1+b2

      先执行任务2再执行任务1所用时间为：a2*t+b2+a1*(a2*t+b2)+b1=a2*t+b2+a1*a2*t+a1*b2+b1

      比较两种顺序的结果可以发现，两者相差的只有a2*b1和a1*b2

因此只要根据这个结论，按次规则将给定的输入从小到大排序，就能顺利求出结果（我的代码中用的是快排)。

 

#include<iostream>
#include<cstdio>

using namespace std;

typedef struct data
{
    double a;
    double b;
} DATA;

DATA h[21];

int Partition(int p,int r)
{
    DATA x=h[r];
    int i=p-1;

    for(int j=p;j<r;j++)
    {
        if(h[j].b*x.a<h[j].a*x.b)
        {
            DATA temp=h[j];
            h[j]=h[i+1];
            h[i+1]=temp;
            i++;
        }
    }

    DATA temp=h[r];
    h[r]=h[i+1];
    h[i+1]=temp;

    return i+1;
}

void QuickSort(int p,int r)
{
    if(p<r)
    {
        int q=Partition(p,r);
        QuickSort(p,q-1);
        QuickSort(q+1,r);
    }
}



int main()
{
    int n,t;

    scanf("%d",&t);

    while(t--)
    {
        scanf("%d",&n);

        for(int i=1;i<=n;i++)
            scanf("%lf %lf",&h[i].a,&h[i].b);

        QuickSort(1,n);

        double result=0;

        for(int i=1;i<=n;i++)
            result+=result*h[i].a+h[i].b;

        printf("%.2f\n",result);
    }

    return 0;
}