A - Class Statistics

A - Class Statistics
Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Description

 ///最开始 没有读懂  Largest gap坑也~~~    是拍好循序后的  连续最大差
 
 #include <iostream>
 #include <string.h>
 #include <stdio.h>
 #include <algorithm>

 using namespace std;

 int main()
 {
     int t;
     int num;
     int n;int a[150];
     scanf("%d",&t);
     for(num=1;num<=t;num++)
     {
         scanf("%d",&n);
         for(int i=0;i<n;i++)
         scanf("%d",&a[i]);
         sort(a,a+n);
         int sum=0;
         for(int i=0;i<n-1;i++)
         {
             if(sum<(a[i+1]-a[i]))
             sum=(a[i+1]-a[i]);
         }
         printf("Class %d\n",num);
         printf("Max %d, Min %d, Largest gap %d\n",a[n-1],a[0],sum);
     }
     return 0;
 }

 

Download as PDF

The new principal of Woop Woop Public plans to meet the teaching team to discuss the performance of the classes/teachers and, being a bean counting fundamentalist, he wants to arm himself with some statistics for the meetings.

Your task is to write a program that reads the pupils' marks in each class and generates performance reports for the principal prior to the meetings.

Input

The input starts with an integer K ( 1$ \le$K$ \le$100) indicating the number of classes on a line by itself. Each of the following K lines gives a class's data, which starts with an integer N ( 2$ \le$N$ \le$50) indicating the number of pupils in the class. The number of pupils is followed by their marks, given as integers, in the range of zero to one hundred, separated by single spaces.

Output

The report for each class consists of two lines.

  • The first line consists of the sentence: "Class X", where X indicates the class number starting with the value of one.
  • The second line reports the maximum class mark, minimum class mark and the largest difference between consecutive marks (when sorted in non-decreasing order) in the class using the formats shown in the sample below.

Sample Input

2
5 30 25 76 23 78
6 25 50 70 99 70 90

Sample Output

Class 1
Max 78, Min 23, Largest gap 46
Class 2
Max 99, Min 25, Largest gap 25

转载于:https://www.cnblogs.com/zhangying/p/3919976.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值