P4600 - Games - 算法设计在线评测系统

内存限制：128 MB 时间限制：1 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：14 通过：8

Bob suggested a game to the girl Alice. There is a list of n arrays, where the i-th array contains m_i≥2 positive integers a_i,1,a_i,2,…,a_i,m

Alice can move at most one (possibly 0) integer from each array to another array. Note that integers can be moved from one array only once, but integers can be added to one array multiple times, and all the movements are done at the same time.The beauty of the list of arrays is defined as the sumIn other words, for each array, we find the minimum value in it and then sum up these values.

The goal of the game is to maximize the beauty of the list of arrays. Help Alice win this challenging game!

Each test consists of multiple test cases. The first line contains a single integer t (1≤t) — the number of test cases. The description of test cases follows.

The first line of each test case contains a single integer n (1≤n) — the number of arrays in the list.

This is followed by descriptions of the arrays. Each array description consists of two lines.

The first line contains a single integer m_i (2≤m_i) — the number of elements in the i-th array.

The next line contains m_i integers a_i,1,a_i,2,…,a_i,m(1≤a_i,_j≤10⁹) — the elements of the i-th array.

It is guaranteed that the sum of m_i over all test cases does not exceed 50000.

For each test case, output a single line containing a single integer — the maximum beauty of the list of arrays that Alice can achieve.

3
2
2
1 2
2
4 3
1
3
100 1 6
3
4
1001 7 1007 5
3
8 11 6
2
2 9

5
1
19

4600: Games

题目描述

输入格式

输出格式

输入样例复制

输出样例复制