OpenJudge-1.9.04:谁拿了最多奖学金

一、题目链接

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

二、解题思路(Java)

三、解题思路(C++)

四、Java程序

import java.util.Scanner;

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

    // 构造方法，用于初始化一个学生对象
    public Student(String name, int score, int vote, char cadre, char west, int paper) {
        this.name = name;
        this.score = score;
        this.vote = vote;
        this.cadre = cadre;
        this.west = west;
        this.paper = paper;
        scholarship = 0;
    }

    // 以下为学生属性的getter和setter方法
    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; // 存储所有学生的奖学金数量
        int i;
        /* 计算每个学生获得的奖学金数量 */
        for (i = 0; i < n; i++) {
            scholarship = 0; // 初始时每个学生奖学金为0
            if (students[i].getScore() > 80 && students[i].getPaper() >= 1) {
                scholarship = scholarship + 8000;
            }
            if (students[i].getScore() > 85 && students[i].getVote() > 80) {
                scholarship = scholarship + 4000;
            }
            if (students[i].getScore() > 90) {
                scholarship = scholarship + 2000;
            }
            if (students[i].getScore() > 85 && students[i].getWest() == 'Y') {
                scholarship = scholarship + 1000;
            }
            if (students[i].getVote() > 80 && students[i].getCadre() == 'Y') {
                scholarship = scholarship + 850;
            }
            students[i].setScholarship(scholarship); // 存储当前学生获得的奖学金数量
        }
        max = students[0].getScholarship(); // 最多的奖学金数量，假定第一个学生奖学金最多
        index = 0; // 最多的奖学金对应的学生位置，假定第一个学生奖学金最多
        /* 从第二个学生开始，到最后一个学生为止 */
        for (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;
        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];
        String name;
        int score;
        int vote;
        char cadre;
        char west;
        int paper;
        for (int i = 0; i < N; i++) {
            name = input.next();
            score = input.nextInt();
            vote = input.nextInt();
            cadre = input.next().charAt(0);
            west = input.next().charAt(0);
            paper = input.nextInt();
            students[i] = new Student(name, score, vote, cadre, west, paper);
        }
        Student ans = test.maxScholarship(students);
        System.out.println(ans.getName());
        System.out.println(ans.getScholarship());
        System.out.print(test.totalScholarship(students));
    }
}

五、C++程序

#include <iostream>
using namespace std;

struct student // 定义student结构体，用于描述学生信息
{
    string name; // 标记学生姓名
    int score; // 标记期末平均成绩
    int vote; // 标记班级评议成绩
    char cadre; // 标记是否学生干部
    char west; // 标记是否是西部省份学生
    int paper; // 标记发表的论文数
    int scholarship; // 标记获得的奖学金数量
};

int main()
{
    int N; // 学生人数
    cin >> N;
    student stu[N]; // 结构体数组，存储所有的学生信息
    int total = 0; // 所有学生的奖学金总数
    int i;
    /* 依次输入每个学生的信息 */
    for (i = 0; i < N; i++)
    {
        cin >> stu[i].name;
        cin >> stu[i].score;
        cin >> stu[i].vote;
        cin.get();
        cin.get(stu[i].cadre);
        cin.get();
        cin.get(stu[i].west);
        cin >> stu[i].paper;
        stu[i].scholarship = 0;
        if (stu[i].score > 80 && stu[i].paper >= 1)
        {
            stu[i].scholarship = stu[i].scholarship + 8000;
        }
        if (stu[i].score > 85 && stu[i].vote > 80)
        {
            stu[i].scholarship = stu[i].scholarship + 4000;
        }
        if (stu[i].score > 90)
        {
            stu[i].scholarship = stu[i].scholarship + 2000;
        }
        if (stu[i].score > 85 && stu[i].west == 'Y')
        {
            stu[i].scholarship = stu[i].scholarship + 1000;
        }
        if (stu[i].vote > 80 && stu[i].cadre == 'Y')
        {
            stu[i].scholarship = stu[i].scholarship + 850;
        }
        total = total + stu[i].scholarship; // 累加所有学生的奖学金总数
    }
    int max = stu[0].scholarship; // 最多的奖学金数量，假定第一个学生奖学金最多
    int index = 0; // 最多的奖学金对应的学生位置，假定第一个学生奖学金最多
    /* 从第二个学生开始，到最后一个学生为止 */
    for (i = 1; i < N; i++)
    {
        if (stu[i].scholarship > max) // 如果当前学生奖学金高于max
        {
            max = stu[i].scholarship; // 则更新max
            index = i; // 更新max对应的位置
        }
    }
    cout << stu[index].name << endl;
    cout << stu[index].scholarship << endl;
    cout << total;
    return 0;
}