Bob is a freshman in Marjar University. He is clever and diligent. However, he is not good at math, especially in Mathematical Analysis.
After a mid-term exam, Bob was anxious about his grade. He went to the professor asking about the result of the exam. The professor said:
"Too bad! You made me so disappointed."
"Hummm... I am giving lessons to two classes. If you were in the other class, the average scores of both classes will increase."
Now, you are given the scores of all students in the two classes, except for the Bob's. Please calculate the possible range of Bob's score. All scores shall be integers within [0, 100].
Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:
The first line contains two integers N (2 <= N <= 50) and M (1 <= M <= 50) indicating the number of students in Bob's class and the number of students in the other class respectively.
The next line contains N - 1 integers A1, A2, .., AN-1 representing the scores of other students in Bob's class.
The last line contains M integers B1, B2, .., BM representing the scores of students in the other class.
Output
For each test case, output two integers representing the minimal possible score and the maximal possible score of Bob.
It is guaranteed that the solution always exists.
Sample Input
2 4 3 5 5 5 4 4 3 6 5 5 5 4 5 3 1 3 2 2 1
Sample Output
4 4 2 4
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<bitset>
#include<numeric>
#include<vector>
#include<string>
#include<iterator>
#include<cstring>
#include<functional>
#define INF 0x3f3f3f3f
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
const int maxn = 55;
const int mod = 1e9 + 7;
const double pi = 3.14159265358979;
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n, m;
scanf("%d%d", &n, &m);
int count = 0, count2 = 0;
for (int i = 1; i < n; i++)
{
int p;
scanf("%d", &p);
count += p;
}
for (int i = 1; i <= m; i++)
{
int p;
scanf("%d", &p);
count2 += p;
}
int minv = INF, maxv = -INF;
for (int i = 0; i <= 100; i++)
{
if ((double)(count + i) / n < (double)count / (n - 1))
{
if ((double)(count2 + i) / (m + 1) > (double)count2 / m)
{
minv = min(minv, i);
maxv = max(maxv, i);
}
}
}
printf("%d %d
", minv, maxv);
}
}