10.结构体习题

最新推荐文章于 2024-05-20 15:29:54 发布

lion_yc

最新推荐文章于 2024-05-20 15:29:54 发布

阅读量328

点赞数 9

分类专栏：算法文章标签： c++

本文链接：https://blog.csdn.net/m0_75178021/article/details/136219702

版权

算法专栏收录该内容

28 篇文章 0 订阅

订阅专栏

P5740 【深基7.例9】最厉害的学生

#include<iostream>
#include<string>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
struct stu{
//    int num;
    string name;
    int chinese;
    int math;
    int English;
    int sum=0;
};
const int N=1e3+10;
stu s[N];
//bool cmp(stu l,stu r){
//    if(l.sum!=r.sum) return l.sum>r.sum;
//    else return l.num<r.num;
//}
int main(){
    int n,mx=1;cin>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i].name>>s[i].chinese>>s[i].math>>s[i].English;
        s[i].sum=s[i].chinese+s[i].math+s[i].English;
        if(s[mx].sum<s[i].sum) mx=i;
    }
//    sort(s+1,s+n+1,cmp);
    cout<<s[mx].name<<" "<<s[mx].chinese<<" "<<s[mx].math<<" "<<s[mx].English;
    return 0;
}

P5741 【深基7.例10】旗鼓相当的对手 - 加强版

#include<iostream>
#include<string>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

struct stu{
    string name;
    int chinese;
    int math;
    int English;
    int sum=0;
};
const int N=1e3+10;
stu s[N];
int main(){
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i].name>>s[i].chinese>>s[i].math>>s[i].English;
        s[i].sum=s[i].chinese+s[i].math+s[i].English;
    }
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(abs(s[i].chinese-s[j].chinese)<=5&&abs(s[i].math-s[j].math)<=5&&abs(s[i].English-s[j].English)<=5&&(abs(s[i].sum-s[j].sum)<=10)){
                if(s[i].name<s[j].name)
                    cout<<s[i].name<<" "<<s[j].name<<endl;
                else
                    cout<<s[j].name<<" "<<s[i].name<<endl;
            }
        }
    }
    return 0;
}

P5742 【深基7.例11】评等级

#include<iostream>
#include<string>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

struct stu{
    int num,xy,sz,zh;
    int cal(){
        return xy+sz;
    }
};
int main(){
    int n;cin>>n;
    //枚举i
    while(n--){
        stu s;
        cin>>s.num>>s.xy>>s.sz;
        s.zh=s.cal();
        if(s.cal()>140&&s.xy*7+s.sz*3>=800){
            cout<<"Excellent"<<endl;
        }
        else
            cout<<"Not excellent"<<endl;
    }
    return 0;
}

P5744 【深基7.习9】培训

#include<iostream>
#include<string>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

struct stu{
    string name;
    int age;
    int grade;
};
int main(){
    int n;cin>>n;
    //枚举i
    while(n--){
        stu s;
        cin>>s.name>>s.age>>s.grade;
        s.age++;
        if(s.grade*1.2>=600) s.grade=600;
        else s.grade*=1.2;
        cout<<s.name<<" "<<s.age<<" "<<s.grade<<endl;
    }
    return 0;
}