Problem Description: n heap stones placed around a playground. Now want to stone in order to merge into a pile. Provision for at least selected pile up election k to heap stones merger into a new pile of combined costs for the new pile of stones number. Try to design an algorithm to calculate the maximum total cost and minimum total cost of n heap stones combined into a pile. Programming tasks: For a given n heap stones, programming calculation merged into a bunch of maximum total cost and minimum total cost. Input test data the first row there are two positive integers n and k, n heap stones, each time at least one selected two heap up selected k heap stones merge. The second row has n numbers denote the number of each heap stones. Output Output maximum total cost and minimum total cost, separated by a space, each answer a row. Sample Input 7 3 45 13 12 16 9 5 22 Sample Output 593 1

code.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．