1 Star 0 Fork 0

hebau_java_cs16/Java_CS01张宁

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
pingfen.java 2.40 KB
一键复制 编辑 原始数据 按行查看 历史
2614 提交于 7年前 . shiyan
package pingfen;
import java.util.Arrays;
import java.util.Scanner;
public class test {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int pernum,judnum;
double score;
String pername;
System.out.println("请输入评委的人数:");
judnum=in.nextInt();
System.out.println("请输入选手的人数:");
pernum=in.nextInt();
Judges judge=new Judges(judnum);
Person[] person=new Person[pernum];
for(int i=0;i<judnum;i++){
System.out.println("请输入选手编号和姓名:");
person[i]=new Person(in.nextInt(),in.next());
System.out.println("请输入选手的成绩:");
judge.inputS();
double[] a=new double[judnum];
a=judge.getS();
judge.maxMin(a);
score=judge.average(a);
System.out.printf("总成绩为:%.2f\n",score);
person[i].setScore(score);
}
Arrays.sort(person);
for(int i=0;i<pernum;i++){
System.out.println(person[i].toString());
}
}
}
package pingfen;
class Person implements Comparable<Person>{
private String name;
private int num;
private double score;
public Person(){
}
public Person(int num,String name){
this.name=name;
this.num=num;
}
public void setName(String name){
this.name=name;
}
public String getName(){
return this.name;
}
public void setNum(int num){
this.num=num;
}
public int getNum(){
return this.num;
}
public void setScore(double score){
this.score=score;
}
public double getScore(){
return this.score;
}
public String toString(){
return "编号:"+this.num+"姓名:"+this.name+"最终得分:"+this.score;
}
public int compareTo(Person o){
if(this.score>o.score){
return -1;
}
else if(this.score<o.score){
return 1;
}
else{
return 0;
}
}
}
package pingfen;
import java.util.Arrays;
import java.util.Scanner;
class Judges {
private int n;
private double[] s;
public Judges(){
}
public Judges(int n){
this.n=n;
}
public void setN(int n){
this.n=n;
}
public int getN(){
return n;
}
public void setS(double[] s){
this.s=s;
}
public double[] getS(){
return s;
}
Scanner in=new Scanner(System.in);
public void inputS(){
s=new double[n];
for(int i=0;i<n;i++){
s[i]=in.nextInt();
}
}
public void maxMin(double[] s){
Arrays.sort(s);
System.out.println("最低分为:"+s[0]);
System.out.println("最高分为:"+s[n-1]);
}
public double average(double[] s){
double sum=0;
for(int j=1;j<n-1;j++){
sum=sum+s[j];
}
sum=(double)sum/(n-2);
return sum;
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/hebau_java_cs16/Java_CS01ZhangNing.git
git@gitee.com:hebau_java_cs16/Java_CS01ZhangNing.git
hebau_java_cs16
Java_CS01ZhangNing
Java_CS01张宁
master

搜索帮助