1004 成绩排名 (20 分)

C/C++版

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 1005;
struct E{
	char name[15]; 
	char courses[15];
	int score;
	bool operator <(const E &b)const{
		return score<b.score;
	} 
}S[maxn];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%s%s%d",S[i].name,S[i].courses,&S[i].score);
	}
	sort(S,S+n);
	printf("%s %s\n",S[n-1].name,S[n-1].courses);
	printf("%s %s",S[0].name,S[0].courses);
	
	return 0;
}

Java版

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		int n;
		Scanner in = new Scanner(System.in);
		n = in.nextInt();
		Student[] stu = new Student[n];
		for(int i = 0; i < n; i++) {
			stu[i] = new Student();
			stu[i].name = in.next();
			stu[i].dis = in.next();
			stu[i].score = in.nextInt();
		}
		Arrays.sort(stu, new cmp());
		
		System.out.println(stu[0].name+" "+stu[0].dis);
		System.out.println(stu[n-1].name+" "+stu[n-1].dis);
	}
	public static class Student{
		
		String dis, name;
		int score;
	}
	public static class cmp implements Comparator{
	
		public int compare(Object ob1, Object ob2) {
			Student st1 = (Student) ob1;
			Student st2 = (Student) ob2;
			
			if(st1.score != st2.score) {
				return st1.score > st2.score ? -1 : 1;
			}else {
				return st1.name.compareTo(st2.name) < 0 ?  1: -1;
			}
		}
	}

}