多机调度算法：利用优先级堆解决任务分配

import java.util.*;
public class MultimachineScheduling   {
    static class JobNode implements Comparable{
        int id,time;
        JobNode(int i,int tt){
            id=i;
            time=tt;
        }
        public int compareTo(Object x){
            int xt=((JobNode)x).time;
            if(time<xt)return -1;
            if (time==xt)return 0;
            return 1;
        }

    }
    static class MachineNode implements Comparable{
        int id,
        avail;
        MachineNode(int i,int a){
            id=i;avail=a;
        }
        public int compareTo(Object x){
            int xa=((MachineNode)x). avail;
            if( avail<xa)return -1;
            if ( avail==xa)return 0;
            return 1;
        }
    }
    public  static int greedy(int []a,int m){

        int n=a.length-1;
        int sum=0;
        if (n<=m){
            sum=MergeSort.Timemax(a);
            System.out.println("为每个作业分配一台机器.");
            return sum;
        }
        JobNode[] d=new JobNode[n];
         for (int i=0;i<n;i++)d[i]=new JobNode(i+1,a[i]);
        int pp=d.length-1;
        MergeSort.mergeSort(d);
        MinHeap H=new MinHeap();
        for (int i=1;i<=m;i++){
            MachineNode x=new MachineNode(i,0);
            H.put(x);
        }
      for (int i=n;i>=1;i--){
          MachineNode x=(MachineNode)H.removeMin();
          System.out.println("将机器"+x.id+"从"+x.avail+"到"+(x.avail+d[i-1].time)+"的时间分配给作业"+d[i-1].id);
          x.avail+=d[i-1].time;
          sum=x.avail;
          H.put(x);
      }
        return sum;
    }
    public static void main(String[] args) {
        MultimachineScheduling multimachineScheduling=new MultimachineScheduling();
        Scanner scanner = new Scanner(System.in);
       System.out.println("请输入机器数量 ");
        int m = scanner.nextInt();