ZOJ 3819 Average Score 水

最新推荐文章于 2021-11-18 21:33:29 发布

码代码的猿猿的AC之路

最新推荐文章于 2021-11-18 21:33:29 发布

阅读量1.1k

点赞数 1

分类专栏：水题

本文链接：https://blog.csdn.net/ck_boss/article/details/40086033

版权

水题专栏收录该内容

126 篇文章

订阅专栏

本文介绍了一个算法问题，需要根据两个班级除Bob外的学生分数来计算Bob可能的成绩范围，确保无论Bob加入哪个班级都能提高该班的平均分。文章提供了一段C++代码实现。

摘要由CSDN通过智能技术生成

水

Average Score

Time Limit: 2 Seconds Memory Limit: 65536 KB

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 A₁, A₂, .., A_N-1 representing the scores of other students in Bob's class.

The last line contains M integers B₁, B₂, .., B_M 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

Sample Output

4 4
2 4

Author: JIANG, Kai
Source: The 2014 ACM-ICPC Asia Mudanjiang Regional Contest

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int INF=0x3f3f3f3f;

int n,m;
int suma,sumb;

int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--)
    {
        scanf("%d%d",&n,&m);
        suma=sumb=0;
        for(int i=0;i<n-1;i++)
        {
            int x;
            scanf("%d",&x);
            suma+=x;
        }
        for(int i=0;i<m;i++)
        {
            int x;
            scanf("%d",&x);
            sumb+=x;
        }
        int MIN=INF,MAX=-INF;
        for(int i=0;i<=100;i++)
        {
            if((suma*n>(suma+i)*(n-1))&&(sumb*(m+1)<(sumb+i)*m))
            {
                MIN=min(MIN,i);
                MAX=max(MAX,i);
            }
        }
        printf("%d %d\n",MIN,MAX);
    }
    return 0;
}