Suppose that you are given two sets a and b, each containing positive integers. you can choose to reorder each set however you like. after reordering, letaibe theith element of set a, and letbibe theith element of set b. you then receive a payoff of∏ni=1abii. givea polynomial-time algorithm that will maximize your payoff. prove that your algorithm maximizes the payoff, and state its running time.

We solve the problem with the following algorithms:  

1. Order A is in the increasing order.

2. Order B is in the decreasing order.

3. Return (A,B).

Explanation:

We need to show that this gives an optimal solution. without the loss of the generality, we can assume that a₁ ≤ a₂ ≤ aₙ in the optimal solution. Since the payoff is  \prod_{i}^{n}=1^{a_{i}^{bi}}, the payoff will always increase if we make a change so that b_{i+1} > b_{i}. Therefore the optimal solution will be found if B is sorted.

The running time is O(n log(n)) since we sort two vector.

answer; a coupon clipped from a newpaper,.discounts;