minutes to complete. Meanwhile, this task has a difficulty level. cannot complete this task. If the company completes this task, they will get. The company has n machines. Each machine has a maximum working time and a level. If the time for the task is more than the maximum working time of the machine, the machine can not complete this task. Each machine can only complete a task one day. Each task can only be completed by one machine.The company hopes to maximize the number of the tasks which they can complete today. If there are multiple solutions, they hopes to make the money maximum.
Today the company has m tasks to complete. The ith task need x_i x i minutes to complete. Meanwhile, this task has a difficulty level y_i y i . The machine whose level below this task's level y_i y i cannot complete this task. If the company completes this task, they will get (500 times x_i+2 times y_i) (500×x i +2×y i )dollars. The company has n machines. Each machine has a maximum working time and a level. If the time for the task is more than the maximum working time of the machine, the machine can not complete this task. Each machine can only complete a task one day. Each task can only be completed by one machine. The company hopes to maximize the number of the tasks which they can complete today. If there are multiple solutions, they hopes to make the money maximum.
