CF1662A.Organizing SWERC

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.

SWERC 的主裁判詹尼收到了大量高质量的题目，现在他需要为 SWERC 选出一套赛题。

他共收到了 $n$ 道题目，并为每道题分配了一个美观度得分和一个难度值。第 $i$ 道题的美观度得分为 $b_i$，难度为 $d_i$。美观度与难度均为 $1$ 到 $10$ 之间的整数。

若某个难度（可能的难度为 $1,2,\dots,10$）没有对应题目，则詹尼将向出题人索要更多题目。

否则，对于每个从 $1$ 到 $10$ 的难度，他将在赛题集中放入一道该难度下美观度最高的题目（因此赛题集恰好包含 $10$ 道难度互不相同的题目）。你需要计算该赛题集的总美观度，即詹尼所选题目的美观度得分之和。

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.

每个测试包含多个测试用例。第一行包含一个整数 $t$（$1\le t\le 100$），表示测试用例的数量。接下来是 $t$ 个测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$1\le n\le 100$），表示 Gianni 从评委处收到的问题数量。

接下来的 $n$ 行每行包含两个整数。其中第 $i$ 行包含 $b_i$ 和 $d_i$（$1\le b_i, d_i\le 10$），分别表示第 $i$ 个问题的美观度得分和难度。

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).

对于每个测试用例，输出吉安尼所选题目集的总美观度。如果吉安尼无法构造出一个题目集（即缺少某一难度级别的题目），则输出字符串 MOREPROBLEMS（全部字母大写，中间无空格）。

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$.

在第一个测试用例中，吉安尼仅收到了 $3$ 道题目，难度分别为 $3, 4, 7$，这些题目不足以构成一套题集（例如，因为缺少难度为 $1$ 的题目）。

在第二个测试用例中，吉安尼将选取题目 $2, 3, 4, 5, 7, 8, 9, 10, 11$（它们的美观度均为 $10$，且难度覆盖了 $1$ 到 $9$ 的所有整数）以及题目 $1$ 和 $6$ 中的任意一道（这两道题的美观度均为 $3$，难度均为 $10$）来构成一套题集。最终题集的总美观度为 $10\cdot 9 + 3 = 93$。