Skiers go fastest with skis whose length is about their height. Your team consists of n members, with heights h1,h2,. , h". Your team gets a...

Hi, there! can someone solve this problem?I upload the question and hints.

• Attachment 1
• Attachment 2

3. Skiers go fastest with skis whose length is about their height. Your team consists of nmembers, with heights h1,h2,. . . , h”. Your team gets a delivery of m 2 7:. pairs of skis, withlengths £1, £2, . . . , 1m. Your goal is to write an algorithm to assign to each skier one pair ofskis to minimize the sum of the absolute differences between the height he: of the skier andthe length of the corresponding ski he got, i.e., to minimize Z lhvi, — 53ml 199:,