zoj_3819_水

Average Score
Time Limit: 2000msMemory Limit: 65536KB This problem will be judged on ZJU. Original ID: 3819
64-bit integer IO format: %lld Java class name: Main
Prev Submit Status Statistics Next
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

一个人在成绩离开a班平均成绩提高,到b班b班的平均成绩提高,问你这个学生成绩的上下线;

解就是 比a班平均分,比b
班平均分高

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,j,m,t;
    while(cin>>t)
    {
        while(t--)
        {
            cin>>n>>m;
            double a=0,b=0,x;
            for(i=0;i<n-1;i++)
            {
                scanf("%lf",&x);
                a+=x;
            }
            a/=n-1;
            for(i=0;i<m;i++)
            {
                scanf("%lf",&x);
                b+=x;
            }
            b/=m;
         //
                printf("%.0lf ",floor(b)+1);
            printf("%.0lf\n",ceil(a)-1);

        }
    }
    return 0;
}