The Croatian version of this contest has the following rules: "Each round of the contest consists of \(8\) tasks with different point values. Every contestant may solve any of the tasks they choose. However, the contestant's final score will be the sum of points earned on any \(5\) tasks such that this sum is maximized."

Since the organizers were busy coming up with interesting problems for the contest (and translating them), they've simply forgotten to solve the problem of determining the points scored by each contestant. Now they are kindly asking you to do it for them.

Write a program that, given the number of points earned by a contestant on each task, determines the total amount of points scored by that contestant, as well as the sorted list of the \(5\) problems counting towards that score. No contestant will ever score the same amount of points on two different problems.

If only the first line of output (the total amount of points) is correct, the solution will be awarded 40%
of points on that test case (even if the second line of output is not present).

Input consists of \(8\) lines. Each line of input contains a single positive integer \(X\) (\(0 \le X \le 150\)), where the number \(X\) in row \(i\) denotes the number of points earned by the contestant on problem \(i\). All \(8\) numbers \(X\) will be distinct.

The first line of output must contain the total amount of points scored by the contestant.

The second line of output must contain indices of the \(5\) problems counting towards the total score, sorted in ascending order, separated by single spaces. Problem indices are positive integers from \(1\) to \(8\), inclusive.

Scoring: If only the first line of output (the total amount of points) is correct, the solution will be awarded \(40\%\) of points on that test case (even if the second line of output is not present).

riseoj 작성

출처 COCI 2011/2012 Contest 2