這是一個採用greedy的方法所寫的machine scheduling，可讓n件工作分配給n台machine，且每台machine最多做一件工作，此程式能在夠用最少的機器來完成所有工作-This is a method written by greedy machine scheduling, the job can be assigned to n n Taiwan machine, and each machine up to do a job, the program can at least be enough machines to do all the work