L1-079 天梯赛的善良 - java

题目解析

输出最大最小的能力值 以及 学生人数

解题思路

比较…

代码

import java.io.*;
import java.math.*;
import java.util.*;

public class Main
{

	public static void main(String[] args) throws IOException
	{
		int n = ini();

		int max = 0, min = 10000000; // 记录最大值与最小值
		int maxcnt = 0, mincnt = 0; // 记录最大值的个数 与 最小值的个数

		while (n-- > 0)
		{
			int a = ini();
			if (a > max)
			{
				max = a;
				maxcnt = 1;
			} else if (a == max)
				maxcnt++;

			if (a < min)
			{
				min = a;
				mincnt = 1;
			} else if (a == min)
				mincnt++;

		}

		out.println(min + " " + mincnt);
		out.println(max + " " + maxcnt);

		out.flush();
		out.close();

	}

	static StreamTokenizer sc = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	static PrintWriter out = new PrintWriter(System.out);

	static int ini() throws IOException
	{
		sc.nextToken();
		return (int) sc.nval;
	}

}


团体程序设计天梯赛-练习集-java

赞赏