浙大pat---1036 Boys vs Girls (25)

本文介绍了一个简单的程序设计问题,即如何找出一组学生中男性最低分数与女性最高分数之间的差距,并展示了一种使用C++实现的具体解决方案。

This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.

Input Specification:

Each input file contains one test case. Each case contains a positive integer N, followed by N lines of student information. Each line contains a student's name, gender, ID and grade, separated by a space, where name and ID are strings of no more than 10 characters with no space, gender is either F (female) or M (male), and grade is an integer between 0 and 100. It is guaranteed that all the grades are distinct.

Output Specification:

For each test case, output in 3 lines. The first line gives the name and ID of the female student with the highest grade, and the second line gives that of the male student with the lowest grade. The third line gives the difference grade~F~-grade~M~. If one such kind of student is missing, output "Absent" in the corresponding line, and output "NA" in the third line instead.

Sample Input 1:

3
Joe M Math990112 89
Mike M CS991301 100
Mary F EE990830 95

Sample Output 1:

Mary EE990830
Joe Math990112
6

Sample Input 2:

1
Jean M AA980920 60

Sample Output 2:

Absent
Jean AA980920
NA
题目解析:
这题就考基础的模拟,使用结构体封装并手动找出最大最小值即可,水题!
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#define MAX 101
using namespace std;
struct student
{
    string name;
    char gender;
    string id;
    int grade;
};
vector<student> male;
vector<student> female;
int main() {
    bool flag = false;
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        student temp;
        cin>>temp.name;
        cin>>temp.gender;
        cin>>temp.id>>temp.grade;
        if(temp.gender=='M')
        {
            male.push_back(temp);
        }
        else{
            female.push_back(temp);
        }
    }
    int max = -1;
    int mim = MAX;
    int female_index;
    int male_index;
    //female highest
    for(int i=0;i<female.size();i++)
    {
        if(max<female[i].grade)
        {
            max = female[i].grade;
            female_index = i;
        }
    }
    for(int i=0;i<male.size();i++)
    {
        if(mim>male[i].grade)
        {
            mim = male[i].grade;
            male_index = i;
        }
    }
    if(max == -1)
    {
        cout<<"Absent"<<endl;
        flag = true;
    }
    else{
        cout<<female[female_index].name<<" "<<female[female_index].id<<endl;
    }
    if(mim == MAX)
    {
        cout<<"Absent"<<endl;
        flag = true;
    }
    else{
        cout<<male[male_index].name<<" "<<male[male_index].id<<endl;
    }
    if(flag)
    {
        cout<<"NA"<<endl;
    }
    else{
        cout<<female[female_index].grade - male[male_index].grade<<endl;
    }

    return 0;
}

  

转载于:https://www.cnblogs.com/SK1997/p/9384292.html

内容概要:本文系统介绍了算术优化算法(AOA)的基本原理、核心思想及Python实现方法,并通过图像分割的实际案例展示了其应用价值。AOA是一种基于种群的元启发式算法,其核心思想来源于四则运算,利用乘除运算进行全局勘探,加减运算进行局部开发,通过数学优化器加速函数(MOA)和数学优化概率(MOP)动态控制搜索过程,在全局探索与局部开发之间实现平衡。文章详细解析了算法的初始化、勘探与开发阶段的更新策略,并提供了完整的Python代码实现,结合Rastrigin函数进行测试验证。进一步地,以Flask框架搭建前后端分离系统,将AOA应用于图像分割任务,展示了其在实际工程中的可行性与高效性。最后,通过收敛速度、寻优精度等指标评估算法性能,并提出自适应参数调整、模型优化和并行计算等改进策略。; 适合人群:具备一定Python编程基础和优化算法基础知识的高校学生、科研人员及工程技术人员,尤其适合从事人工智能、图像处理、智能优化等领域的从业者;; 使用场景及目标:①理解元启发式算法的设计思想与实现机制;②掌握AOA在函数优化、图像分割等实际问题中的建模与求解方法;③学习如何将优化算法集成到Web系统中实现工程化应用;④为算法性能评估与改进提供实践参考; 阅读建议:建议读者结合代码逐行调试,深入理解算法流程中MOA与MOP的作用机制,尝试在不同测试函数上运行算法以观察性能差异,并可进一步扩展图像分割模块,引入更复杂的预处理或后处理技术以提升分割效果。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值