act1.cpp

来自「数据结构c++语言描述 Borland C++实现」· C++ 代码 · 共 38 行

// average completion time with one person

#include <iostream.h>
#include "hsort.h"

class Task {
   friend void main(void);
   public:
      operator int () const
         {return time;}
   private:
     int ID,   // task ID
         time; // task time
};

template <class T>
void ACT(T J[], int n)
{// Reorder the n tasks so that the average
 // completion time is minimized
   HeapSort(J,n);
}

void main(void)
{
   int n = 12;  // number of tasks
   Task J[13];
   // create n tasks
   for (int i = 1; i <= n; i++) {
      J[i].ID = i;
      J[i].time = 20 - i;
      }
   ACT(J, n);
   cout << "The tasks should be done in the order" << endl;
   for (int i = 1; i <= n; i++)
      cout << J[i].ID << ' ';
   cout << endl;
}