04:谁拿了最多奖学金

一、题目链接

http://noi.openjudge.cn/ch0109/04/

二、解题思路

三、实施步骤

四、Java程序

import java.util.Scanner;

class Student { // 学生信息类
    private String name; // 学生姓名
    private int score; // 期末平均成绩
    private int vote; // 班级评议成绩
    private char cadre; // 标记是否学生干部
    private char west; // 标记是否是西部省份学生
    private int paper; // 发表的论文数
    private int scholarship; // 获得奖学金的数量

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getScore() {
        return score;
    }

    public void setScore(int score) {
        this.score = score;
    }

    public int getVote() {
        return vote;
    }

    public void setVote(int vote) {
        this.vote = vote;
    }

    public char getCadre() {
        return cadre;
    }

    public void setCadre(char cadre) {
        this.cadre = cadre;
    }

    public char getWest() {
        return west;
    }

    public void setWest(char west) {
        this.west = west;
    }

    public int getPaper() {
        return paper;
    }

    public void setPaper(int paper) {
        this.paper = paper;
    }

    public int getScholarship() {
        return scholarship;
    }

    public void setScholarship(int scholarship) {
        this.scholarship = scholarship;
    }
}

public class Main {
    /**
     * 返回获得奖学金最多的学生记录
     *
     * @param students Student类型的数组，存储所有学生记录
     * @return Student类型的对象，代表获得奖学金最多的学生记录
     */
    public Student maxScholarship(Student[] students) {
        int n = students.length; // 学生人数
        int max; // 最多的奖学金数量
        int index; // 获得奖学金最多的学生位置
        int scholarship; // 存储所有学生的奖学金数量
        /* 遍历所有学生记录 */
        for (Student student : students) {
            scholarship = 0; // 初始时每个学生获得的奖学金数量为0
            if (student.getScore() > 80 && student.getPaper() >= 1) {
                scholarship = scholarship + 8000;
            }
            if (student.getScore() > 85 && student.getVote() > 80) {
                scholarship = scholarship + 4000;
            }
            if (student.getScore() > 90) {
                scholarship = scholarship + 2000;
            }
            if (student.getScore() > 85 && student.getWest() == 'Y') {
                scholarship = scholarship + 1000;
            }
            if (student.getVote() > 80 && student.getCadre() == 'Y') {
                scholarship = scholarship + 850;
            }
            student.setScholarship(scholarship); // 设置当前学生获得的奖学金数量
        }
        max = students[0].getScholarship(); // 初始时假定第一个学生获得的奖学金最多
        index = 0; // 最多的奖学金对应的学生位置
        /* 从第二个学生开始，到最后一个学生为止 */
        for (int i = 1; i < n; i++) {
            if (students[i].getScholarship() > max) { // 如果当前学生获得的奖学金高于max
                max = students[i].getScholarship(); // 更新max
                index = i; // 更新max对应的位置
            }
        }
        return students[index]; // 返回获得奖学金最多的学生记录
    }

    /**
     * 计算所有学生获得的奖学金总数
     *
     * @param students Student类型的数组，存储所有学生记录
     * @return int类型的整数，代表所有学生获得的奖学金总数
     */
    public int totalScholarship(Student[] students) {
        int ans = 0; // 所有学生获得的奖学金总数，初始时为0
        /* 遍历所有学生记录 */
        for (Student t : students) {
            ans = ans + t.getScholarship(); // 累加奖学金总数
        }
        return ans;
    }

    public static void main(String[] args) {
        Main test = new Main();
        Scanner input = new Scanner(System.in);
        int N = input.nextInt();
        Student[] students = new Student[N];
        for (int i = 0; i < N; i++) {
            students[i] = new Student();
            students[i].setName(input.next());
            students[i].setScore(input.nextInt());
            students[i].setVote(input.nextInt());
            students[i].setCadre(input.next().charAt(0));
            students[i].setWest(input.next().charAt(0));
            students[i].setPaper(input.nextInt());
        }
        Student ans = test.maxScholarship(students);
        System.out.println(ans.getName());
        System.out.println(ans.getScholarship());
        System.out.print(test.totalScholarship(students));
    }
}