原题链接:蓝桥杯算法提高VIP-分数统计
解题思路:
注意事项:
参考代码:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i] = sc.nextInt();
}
int max = arr[0];
for (int i = 1; i < arr.length; i++) {
for (int j = 0; j < arr.length - 1; j++) {
if (arr[j] < arr[j + 1]) {
max = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = max;
}
}
}
int A = 0;
int B = 0;
int C = 0;
int D = 0;
int E = 0;
ArrayList list = new ArrayList();
String[] str = new String[5];
str[0] = "";
str[1] = "";
str[2] = "";
str[3] = "";
str[4] = "";
for (int i = 0; i < arr.length; i++) {
if (arr[i] >= 90 && arr[i] <= 100) {
A++;
str[0] += arr[i] + " ";
}
if (arr[i] >= 80 && arr[i] < 90) {
B++;
str[1] += arr[i] + " ";
}
if (arr[i] >= 70 && arr[i] < 80) {
C++;
str[2] += arr[i] + " ";
}
if (arr[i] >= 60 && arr[i] < 70) {
D++;
str[3] += arr[i] + " ";
}
if (arr[i] >= 0 && arr[i] < 60) {
E++;
str[4] += arr[i] + " ";
}
}
System.out.println(A + " " + B + " " + C + " " + D + " " + E);
int[] count = new int[5];
count[0] = A;
count[1] = B;
count[2] = C;
count[3] = D;
count[4] = E;
Arrays.sort(count);
System.out.println(count[count.length - 1]);
if (A == count[count.length - 1]) {
System.out.print(str[0]);
} else if (B == count[count.length - 1]) {
System.out.print(str[1]);
} else if (C == count[count.length - 1]) {
System.out.print(str[2]);
} else if (D == count[count.length - 1]) {
System.out.print(str[3]);
} else if (E == count[count.length - 1]) {
System.out.print(str[4]);
}
}
}0.0分
5 人评分
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程,并配有习题和答疑,点击了解:
一点编程也不会写的:零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码?手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程:算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程
发表评论 取消回复