Taxi#2208
After a lengthy meeting, the director of a company decided to order taxis to take his employees home. He ordered taxis, exactly as many as the number of employees. However, when the taxis arrived, it turned out that each taxi driver had their own rate per kilometer.
The director knows how many kilometers each employee needs to travel from work to home (unfortunately, all employees live in different directions, so no two employees can share a taxi). The director now wants to determine which employee should take which taxi to minimize the total taxi expenses (covered by the company).
The input starts with a natural number (1 \leq N \leq 1000) — the number of company employees (equal to the number of ordered taxis). Then numbers follow, which give the distances in kilometers from work to each employee's home (the first number is for the first employee, the second for the second, etc.). All distances are positive integers not exceeding . After that, another numbers follow — the per kilometer rates for each taxi (the first number for the first taxi, the second for the second, etc.). The rates are positive integers not exceeding .
Output numbers. The first number is the taxi number to which the first employee should be assigned, the second number is for the second employee, and so on, to minimize the total taxi expenses. If there are multiple assignments that achieve the minimum expenses, you may output any of them.
Example 1