Organizing SWERC
Contest: SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)
Tags: brute force, implementation

Gianni, SWERC's chief judge, received a huge amount of high quality problems from the judges and now he has to choose a problem set for SWERC.

He received $$$n$$$ problems and he assigned a beauty score and a difficulty to each of them. The $$$i$$$-th problem has beauty score equal to $$$b_i$$$ and difficulty equal to $$$d_i$$$. The beauty and the difficulty are integers between $$$1$$$ and $$$10$$$.

If there are no problems with a certain difficulty (the possible difficulties are $$$1,2,\dots,10$$$) then Gianni will ask for more problems to the judges.

Otherwise, for each difficulty between $$$1$$$ and $$$10$$$, he will put in the problem set one of the most beautiful problems with such difficulty (so the problem set will contain exactly $$$10$$$ problems with distinct difficulties). You shall compute the total beauty of the problem set, that is the sum of the beauty scores of the problems chosen by Gianni.

Input format:
Each test contains multiple test cases. The first line contains an integer $$$t$$$ ($$$1\le t\le 100$$$) — the number of test cases. The descriptions of the $$$t$$$ test cases follow.

The first line of each test case contains the integer $$$n$$$ ($$$1\le n\le 100$$$) — how many problems Gianni received from the judges.

The next $$$n$$$ lines contain two integers each. The $$$i$$$-th of such lines contains $$$b_i$$$ and $$$d_i$$$ ($$$1\le b_i, d_i\le 10$$$) — the beauty score and the difficulty of the $$$i$$$-th problem.

Output format:
For each test case, print the total beauty of the problem set chosen by Gianni. If Gianni cannot create a problem set (because there are no problems with a certain difficulty) print the string MOREPROBLEMS (all letters are uppercase, there are no spaces).

Constraints:
Time limit: 2.0 s
Memory limit: 256.0 MB

Note:
In the first test case, Gianni has received only $$$3$$$ problems, with difficulties $$$3, 4, 7$$$ which are not sufficient to create a problem set (for example because there is not a problem with difficulty $$$1$$$).

In the second test case, Gianni will create a problem set by taking the problems $$$2$$$, $$$3$$$, $$$4$$$, $$$5$$$, $$$7$$$, $$$8$$$, $$$9$$$, $$$10$$$, $$$11$$$ (which have beauty equal to $$$10$$$ and all difficulties from $$$1$$$ to $$$9$$$) and one of the problems $$$1$$$ and $$$6$$$ (which have both beauty $$$3$$$ and difficulty $$$10$$$). The total beauty of the resulting problem set is $$$10\cdot 9 + 3 = 93$$$.

Example input:
2
3
8 4
9 3
6 7
12
3 10
10 1
10 2
10 3
10 4
3 10
10 5
10 6
10 7
10 8
10 9
1 10

Example output:
MOREPROBLEMS
93

Editorial:
This is the ice breaker problem of the contest. To solve it one shall implement what is described in the statement.
One way to implement it is to keep an array $$$\texttt{beauty}[1\dots10]$$$ (initialized to $$$0$$$), so that, for $$$1\le \texttt{diff}\le 10$$$, the value $$$\texttt{beauty}[\texttt{diff}]$$$ corresponds to the maximum beauty of a proposed problem with difficulty equal to $$$\texttt{diff}$$$. One can update the entries of $$$\texttt{beauty}$$$ while processing the input. In the end, if some entries of $$$\texttt{beauty}$$$ are still $$$0$$$ then the correct output is $$$\texttt{MOREPROBLEMS}$$$, otherwise it is the sum of the entries $$$\texttt{beauty}[1] + \texttt{beauty}[2] + \cdots + \texttt{beauty}[10]$$$.
Notice that the small size of the input allows for less efficient solutions. For instance, one could iterate $$$10$$$ times over the problems, once for each difficulty, and find the maximum beauty associated with difficulty $$$i$$$ during the $$$i$$$-th iteration (this way, array $$$\texttt{beauty}$$$ is not needed).