ZOJ 3819 Average Score （水）

最新推荐文章于 2018-10-21 12:50:53 发布

原创最新推荐文章于 2018-10-21 12:50:53 发布 · 421 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

104 篇文章

订阅专栏

Bob是Marjar大学的一名新生，在数学分析方面遇到困难。一次期中考试后，教授告诉Bob如果他在另一个班级，两个班的平均分都会提高。题目要求计算Bob可能的成绩范围。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

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


这道题感觉没什么好解释的，有很多姿势可以过，就不写了吧

ac代码：
#include<stdio.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define MAXN 8000010
#define INF 0xfffffff
#define mod 1000000007
#define LL long long
using namespace std;
int sum1,sum2;
int a[MAXN],b[MAXN];
int main()
{
	int n,m;
	int t,i;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		sum1=0;sum2=0;
		for(i=0;i<n-1;i++)
		{
			scanf("%d",&a[i]);
			sum1+=a[i];
		}
		for(i=0;i<m;i++)
		{
			scanf("%d",&b[i]);
			sum2+=b[i];
		}
		double num1,num2;
		num1=1.0*sum1/(n-1);num2=1.0*sum2/m;
		int ans1=(int)floor(num2+1.0);
		int ans2=(int)ceil(num1-1.0);
		if(ans1<0)
		ans1=0;
		if(ans2<0)
		ans2=0;
		//printf("%lf %lf\n",num1,num2);
		printf("%d %d\n",ans1,ans2);
	}
	return 0;
}