博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
ZOJ 3819 Average Score(数学 牡丹江游戏网站)
阅读量:6826 次
发布时间:2019-06-26

本文共 2137 字,大约阅读时间需要 7 分钟。

主题链接:

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 A1A2, .., AN-1 representing the scores of other students in Bob's class.

The last line contains M integers B1B2, .., 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

24 35 5 54 4 36 55 5 4 5 31 3 2 2 1

Sample Output

4 42 4

Author: 
JIANG, Kai

PS:2014年ACM/ICPC 亚洲区域赛牡丹江(第一站)___签到题!

代码例如以下:

#include 
#include
int main(){ int t; int n, m; int minn, maxx; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); double sum1=0, sum2=0; int a; for(int i = 0; i < n-1; i++) { scanf("%d",&a); sum1+=a; } for(int i = 0; i < m; i++) { scanf("%d",&a); sum2+=a; } double avg1=(sum1/(n-1.0)); double avg2=sum2/(m*1.0); if((int)avg1==avg1) maxx=(int)avg1-1; else maxx=(int)avg1; minn=(int)avg2+1; printf("%d %d\n",minn,maxx); } return 0;}

转载地址:http://rhezl.baihongyu.com/

你可能感兴趣的文章
VS2010插件及快捷键持续更新
查看>>
技术栈累积
查看>>
nginx处理别人域名解析到你的ip
查看>>
jQuery的简单小结
查看>>
LNMP架构(架构介绍,mysql安装,php安装,nginx介绍)
查看>>
Linux下查看用户列表
查看>>
svn图标显示问题
查看>>
卷积神经网络在图像分割中的进化史:从R-CNN到Mask R-CNN
查看>>
OpenSSH详解
查看>>
JavaScript Tips
查看>>
继续上章节的ospf重分布实验演示一
查看>>
RHEL6 64位ASM方式安装oracle 11gR2(二)
查看>>
玩转日志第一步,通过fluentd转存nginx日志
查看>>
awk 应用
查看>>
网站常见漏洞 -- 文件上传漏洞
查看>>
Struts2学习(六):访问隐藏的request和session
查看>>
结合项目实例 回顾传统设计模式(四)工厂模式(简单工厂、普通工厂、抽象工厂)...
查看>>
我了解的西安软件外包业务
查看>>
第57期:LPWAN技术之超窄带(UNB)浅析
查看>>
Frankfan7你问我答之一
查看>>