作业调度

 

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e3+5;
struct node{
    int a, b;
}homework[maxn];//结构体，作业数组
int t1[maxn],t2[maxn];//N1数组，N2数组
int m1[maxn];//存放作业调度顺序
int n, num1, num2, sum;//作业数目，N1数组数目，N2数组数目，总时间
void InputAndInit(){//输入和初始化
    num1 = 0, num2 = 0, sum = 0;
    printf("请输入每个作业在a,b机器上加工需要的时间，空格分割\n");
    for(int i = 0; i < n; i++) {
        m1[i] = i;
        scanf("%d%d",&homework[i].a,&homework[i].b);
        if(homework[i].a < homework[i].b) t1[num1++] = i;//满足a<b,则放入N1数组
        else t2[num2++] = i;//否则放入N2数组
    }
}
bool cmp(const int x, const int y){
    return homework[x].a < homework[y].a;//按照a的大小进行非降序排列
}
bool cmp1(const int x, const int y){
    return homework[x].b > homework[y].b;//按照b的大小进行非升序排列
}
void Schedule(){
    sort(t1, t1+num1, cmp);//不同排序规则
    sort(t2, t2+num2, cmp1);
    for(int i = 0; i < num1; i++)m1[i] = t1[i];
    for(int i = 0; i < num2; i++)m1[num1+i] = t2[i];
    int t = homework[m1[0]].a;//t最初为π(1)a
    sum = t + homework[m1[0]].b;
    for(int i = 1; i < n; i++){
        t += homework[m1[i]].a;
        if(t < sum) sum = sum + homework[m1[i]].b;//作业积压,sum + homework[m1[i]].b
        else sum = t + homework[m1[i]].b;//作业空余,sum = t + homework[m1[i]].b
    }
}
void Print(){
    printf("最佳调度方式为:\n");
    for(int i = 0; i < n; i++){
        if(i)printf(" ");
        printf("%d",m1[i]);
    }printf("\n花费时间为:\n");
    printf("%d\n",sum);
}
int main()
{
    printf("请输入作业数目,数目为负终止输入\n");
    while(~scanf("%d",&n)&&n){
        InputAndInit();
        Schedule();
        Print();
    }
}