463 条题解

  • 30
    @ 2016-12-10 10:15:10
    #include<iostream>
    using namespace std;
    int main()
    {
        string a,g;
        int b,c,f,n,money=0,result=0,sum=0;
        char d,e;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            cin>>a>>b>>c>>d>>e>>f;
            money=0;
            if(b>80&&f>=1)
            money+=8000;
            if(b>85&&c>80)
            money+=4000;
            if(b>90)
            money+=2000;
            if(b>85&&e=='Y')
            money+=1000;
            if(c>80&&d=='Y')
            money+=850;
            sum+=money;
            if(result<money)
            {
                result=money;
                g=a;
            }
        }
        cout<<g<<endl<<result<<endl<<sum<<endl;
        return 0;
    }
    
  • 4
    @ 2009-04-04 09:45:58

    输入数据时千万要记得 占位符 加空格

    scanf("%s %d %d %c %c %d"

  • 1
    @ 2020-09-12 17:12:36
    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    
    struct people{
        std::string name;
        int qi, ban, lun, num, id;
        char student, xibu;
    }a[50000];
    
    bool comp(people x, people y){
        if(x.num == y.num) return x.id < y.id;
        return x.num > y.num; 
    }
    
    int judge(int &num, int qi, int ban, char student, char xibu, int lun){
        num = 0;
        if(qi > 80 and lun >= 1) num += 8000;
        if(qi > 85 and ban > 80) num += 4000; 
        if(qi > 90 ) num += 2000;
        if(qi > 85 and xibu == 'Y') num += 1000;
        if(ban > 80 and student == 'Y') num += 850;
        return 0 ;
    }
    
    int n, ans;
    
    int main(){
        scanf("%d" , &n);
        for(int i = 0; i < n; i ++){
            std :: cin >> a[i].name;
            scanf("%d%d%s%s%d", &a[i].qi, &a[i].ban, &a[i].student, &a[i].xibu, &a[i].lun);
            judge(a[i].num, a[i].qi, a[i].ban, a[i].student, a[i].xibu, a[i].lun);
            ans += a[i].num;
            a[i].id = i;
        }
        std :: sort(a, a+n, comp ) ;
        std :: cout << a[0].name << "\n";
        printf("%d\n%d", a[0].num, ans);
            return 0 ; 
    }
    
  • 1
    @ 2020-08-02 12:26:36

    一道模拟题,用结构体struct存入每位学生的信息,之后一次判断即可。

    注意:题目中说每位学生可以获得多项奖,所以使用if语句并列写,如题目中写每位学生只能获得最先拿到的一项奖,则应使用if……else语句!

    \(Code\)

    #include<bits/stdc++.h>
    using namespace std;
    int n;
    struct node{
        string name;
        int sc;
        int score;
        char f;
        char f1;
        int num;
        int sum;
        int m; 
    }a[110];
    /*
    name:姓名
    sc:期末成绩
    score:评测成绩
    f:是否为干部
    f1:是否为西部学生
    num:论文数
    sum:奖学金数
    m;编号 
    */
    bool cmp(node c,node d){
        if(c.sum>d.sum||c.sum==d.sum&&c.m<d.m){
            return true;
        }else{
            return false;
        }
    }
    int s3;
    int main(){
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i].name>>a[i].sc>>a[i].score>>a[i].f>>a[i].f1>>a[i].num;
            a[i].m=i;
        }
        for(int i=1;i<=n;i++){
            if(a[i].sc>80&&a[i].num>=1){
                a[i].sum+=8000;
            }
            if(a[i].sc>85&&a[i].score>80){
                a[i].sum+=4000;
            }
            if(a[i].sc>90){
                a[i].sum+=2000;
            }
            if(a[i].sc>85&&a[i].f1=='Y'){
                a[i].sum+=1000;
            }
            if(a[i].score>80&&a[i].f=='Y'){
                a[i].sum+=850;
            }
            s3+=a[i].sum;
        }
        sort(a+1,a+n+1,cmp);
        cout<<a[1].name<<endl;
        cout<<a[1].sum<<endl;
        cout<<s3;
        return 0;
    }
    
  • 1
    @ 2020-03-01 11:50:41

    竟然没有Pascal的题解,那我就来水一发

    代码

    var
      n,i,k,j,o,lw,sum,s:longint;
      x,gb,xb:string;
      a:array[1..100] of string;
      b:array[1..100] of longint;
    begin
      readln(n);
      for i:=1 to n do
        begin
          readln(x); x:=x+' ';
          k:=pos(' ',x); a[i]:=copy(x,1,k-1); delete(x,1,k);
          k:=pos(' ',x); val(copy(x,1,k-1),j); delete(x,1,k);
          k:=pos(' ',x); val(copy(x,1,k-1),o); delete(x,1,k);
          k:=pos(' ',x); gb:=copy(x,1,k-1); delete(x,1,k);
          k:=pos(' ',x); xb:=copy(x,1,k-1); delete(x,1,k);
          k:=pos(' ',x); val(copy(x,1,k-1),lw); delete(x,1,k);
          if (j>80) and (lw>=1) then inc(b[i],8000);
          if (j>85) and (o>80) then inc(b[i],4000);
          if j>90 then inc(b[i],2000);
          if (j>85) and (xb='Y') then inc(b[i],1000);
          if (o>80) and (gb='Y') then inc(b[i],850);
          if b[i]>sum then sum:=b[i];
          inc(s,b[i]);
        end;
      for i:=1 to n do
        if sum=b[i] then
          begin
            writeln(a[i]);
            writeln(b[i]);
            writeln(s);
            break;
          end;
    end.
    
  • 1
    @ 2020-02-01 16:44:13
    /*
    用类的思想对学生信息进行封装,添加学生基本信息
    定义计算学生奖学金的函数,用多个判断语句计算学生奖学金
    最后进行比较
    */
    #include <iostream>
    
    using namespace std;
    
    class students {
    public:
        char name[20], cadre, west;
        int finalgrade, classgrade, thesis, scholarship = 0;
        void scholarshipcount(void) {
            if (this->finalgrade > 80 && this->thesis > 0)scholarship += 8000;
            if (this->finalgrade > 85 && this->classgrade > 80)scholarship += 4000;
            if (this->finalgrade > 90)scholarship += 2000;
            if (this->finalgrade > 85 && this->west == 'Y')scholarship += 1000;
            if (this->classgrade > 80 && this->cadre == 'Y')scholarship += 850;
        }
        students(){}
        ~students(){}
    };
    int main()
    {
        int N, totalscholarship = 0;
        students student[100];
        cin >> N;
        for (int i = 0; i < N; i++) {
            cin >> student[i].name >> student[i].finalgrade >> student[i].classgrade >> student[i].cadre
                >> student[i].west >> student[i].thesis;
            student[i].scholarshipcount();
            totalscholarship += student[i].scholarship;
        }
        students studentbest=student[0];
        for (int i = 1; i < N; i++) {
            if (studentbest.scholarship < student[i].scholarship)studentbest = student[i];
        }
        cout << studentbest.name << endl << studentbest.scholarship << endl << totalscholarship;
        return 0;
    }
    
  • 0
    @ 2020-09-16 21:30:02
    #include<cstdio>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    struct Student
    {
        string name;
        int id,aver,comm,acti,total;
        bool west,stu;
    }student[105];
    int cmp(Student a,Student b)
    {
        if(a.total==b.total)
        return a.id<b.id;
        return a.total>b.total;
    }
    int main()
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            char isWest,isStu;
            cin>>student[i].name>>student[i].aver>>student[i].comm>>isStu>>isWest>>student[i].acti;
            student[i].stu=(isStu=='Y')?true:false;
            student[i].west=(isWest=='Y')?true:false;
            student[i].id=i;
        }
        int res=0;
        for(int i=1;i<=n;i++)
        {
            if(student[i].aver>80&&student[i].acti>=1)
            student[i].total+=8000,res+=8000;
            else;
            if(student[i].aver>85&&student[i].comm>80)
            student[i].total+=4000,res+=4000;
            else;
            if(student[i].aver>90)
            student[i].total+=2000,res+=2000;
            else;
            if(student[i].aver>85&&student[i].west)
            student[i].total+=1000,res+=1000;
            else;
            if(student[i].comm>80&&student[i].stu)
            student[i].total+=850,res+=850;
            else;
        }
        sort(student+1,student+1+n,cmp);
        cout<<student[1].name<<endl<<student[1].total<<endl<<res<<endl;
        return 0;
    }
    
  • 0
    @ 2020-08-21 11:10:26
    #include<bits/stdc++.h>
    using namespace std;
    struct student 
    {
        string name;
        int qm;
        int py;
        char mas;
        char wes;
        int lw;
        int mai;
    };
    student a[1001];
    int main() 
    {
        int n;
        int addmai=0;
        int k=0;
        int maxmai=-100;
        cin>>n;
        for(int i=0; i<n; i++) 
    {
            cin>>a[i].name;
            cin>>a[i].qm>>a[i].py;
            cin>>a[i].mas>>a[i].wes;
            cin>>a[i].lw;
        }
        for(int i=0; i<n; i++) 
    {
            if(a[i].qm>80&&a[i].lw>=1)a[i].mai+=8000;
            if(a[i].qm>85&&a[i].py>80)a[i].mai+=4000;
            if(a[i].qm>90)a[i].mai+=2000;
            if(a[i].qm>85&&a[i].wes=='Y')a[i].mai+=1000;
            if(a[i].py>80&&a[i].mas=='Y')a[i].mai+=850;
            addmai+=a[i].mai;
            if(maxmai!=a[i].mai) 
            {
                maxmai=max(maxmai,a[i].mai);
                if(maxmai==a[i].mai)k=i;
            }
        }
        cout<<a[k].name<<endl<<maxmai<<endl<<addmai<<endl;
        return 0;
    }
    
  • 0
    @ 2020-07-09 22:03:09
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int n,cj1,cj2,sum=0,max=0,s=0,x,i;
        char a,b;
        string ne,maxx;
        cin>>n;
        for(i=1;i<=n;i++)
        {
            cin>>ne>>cj1>>cj2>>a>>b>>x;
            if(cj1>80 && x>0)
                sum+=8000;
            if(cj1>85 && cj2>80)
                sum+=4000;
            if(cj1>90)
                sum+=2000;
            if(cj1>85 && b=='Y')
                sum+=1000;
            if(cj2>80 && a=='Y')
                sum+=850;
            s+=sum;
            if(sum>max)
                maxx=ne,max=sum;
            sum=0;
        }
        cout<<maxx<<endl<<max<<endl<<s;
        return 0;
    }
    
  • 0
    @ 2020-06-03 16:54:16
    #include<iostream>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    const int N = 100;
    struct Student
    {
        string name;
        int p;
        int y;
        char x;
        char g;
        int paper;
        int money;
    };
    Student cls[N+1];
    int main()
    {
        int n,am = 0;
        cin >> n;
        for(int i=0;i<n;i++)
        {
            cin >> cls[i].name;
            cin >> cls[i].p;
            cin >> cls[i].y;
            cin >> cls[i].g;
            cin >> cls[i].x;
            cin >> cls[i].paper;
        }
        for(int i=0;i<n;i++)
        {
            if(cls[i].p>80&&cls[i].paper>=1)
            {
                cls[i].money+=8000;
            }
            if(cls[i].p>85&&cls[i].y>80)
            {
                cls[i].money+=4000;
            }
            if(cls[i].p>90)
            {
                cls[i].money+=2000;
            }
            if(cls[i].p>85&&cls[i].x=='Y')
            {
                cls[i].money+=1000;
            }
            if(cls[i].y>80&&cls[i].g=='Y')
            {
                cls[i].money+=850;
            }
        }
        int Max=0;
        string Name;
        for(int i=0;i<n;i++)
        {
            if(Max<cls[i].money){
                Max=cls[i].money;
                Name=cls[i].name;
            }
            am+=cls[i].money;
        }
        cout << Name << endl;
        cout << Max << endl;
        cout << am;
        return 0;
    }
    

    结构体和if的简单练手题

  • 0
    @ 2020-05-31 10:23:09
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int n,m,em,sum=0,max=0,total=0,x,i;
        char a,b;
        string name,dalao;
        cin>>n;
        for(i=1;i<=n;i++){
            cin>>name>>m>>em>>a>>b>>x;
            if(m>80 && x>0){
                sum+=8000;
            }
            if(m>85 && em>80){
                sum+=4000;
            }
            if(m>90){
                sum+=2000;
            }
            if(m>85 && b=='Y'){
                sum+=1000;
            }
            if(em>80 && a=='Y'){
                sum+=850;
            }
            total+=sum;
            if(sum>max){
                dalao=name,max=sum;
            }
            sum=0;
        }
        cout<<dalao<<endl;
        cout<<max<<endl;
        cout<<total;
    }
    

    谔谔

    • @ 2020-06-05 12:28:49

      dalao可还行

  • 0
    @ 2020-05-09 13:50:54

    用结构体模拟即可
    cpp
    #include<iostream>
    #include<string>
    using namespace std;
    struct student{
    string a;
    int o,oo,ooo;
    char on,ok;
    }b[100];
    main()
    {
    int n,tmp[100]={0},max=0,sum=0,k,a,ba;
    cin>>n;
    for(int i=0;i<n;i++)
    {
    cin>>b[i].a>>b[i].o>>b[i].oo>>b[i].on>>b[i].ok>>b[i].ooo;
    if(b[i].o>80&&b[i].ooo) tmp[i]+=8000;
    if(b[i].o>85&&b[i].oo>80) tmp[i]+=4000;
    if(b[i].o>90) tmp[i]+=2000;
    if(b[i].o>85&&b[i].ok=='Y') tmp[i]+=1000;
    if(b[i].oo>80&&b[i].on=='Y') tmp[i]+=850;
    sum+=tmp[i];
    if(tmp[i]>max)
    {
    max=tmp[i];
    k=i;
    }
    }
    cout<<b[k].a<<endl<<max<<endl<<sum;
    return 0;
    }

    ```

  • 0
    @ 2020-04-24 21:51:11
    #include <iostream>
    
    using namespace std;
    
    int main()
    {
        int a, b;
        cin >> a >> b;
        cout << a + b << endl;
    }
    
    
  • 0
    @ 2020-03-10 16:54:25

    思路:暴力模拟,祝**AC**

    #include <iostream>
    #include <cstring>
    using namespace std;
    
    int main()
    {
        /*
        没用什么高级语法,写给新手
        变量名解释
        N(题目中N)
        当前处理学生的:name(姓名),pj(平均成绩),bj(班级评议成绩),
                       gb(干部?),xb(西部省份学生?),lw(论文数),jj(奖金数)
        答案:zgjj(最高奖金),zgname(拿到最高奖金的学生姓名),zjj(总奖金)
        */
        char name[21], zgname[21], gb, xb;
        int N, pj, bj, lw, jj, zjj = 0, zgjj = 0;
        scanf("%d", &N);
        for (int i = 0; i < N; ++i)
        {
            jj = 0;
            scanf("%s %d %d %c %c %d\n", name, &pj, &bj, &gb, &xb, &lw);
            //win下模拟输入时 Ctrl+z 输入 EOF 
            if (pj > 80 && lw)          jj += 8000;
            if (pj > 85 && bj > 80)     jj += 4000;
            if (pj > 90)                jj += 2000;
            if (pj > 85 && xb == 'Y')   jj += 1000;
            if (bj > 80 && gb == 'Y')   jj += 850;
            if (jj > zgjj)              zgjj = jj, strcpy(zgname, name);
            zjj += jj;
        }
        printf("%s\n%d\n%d", zgname, zgjj, zjj);
    }
    
  • 0
    @ 2020-02-20 18:46:20
    #include<iostream>
    #include<cmath>
    #include<string>
    #include<algorithm>
    using namespace std;
    int v[10001];
    struct person
    {
        string name;
        int qm,sl,py;
        int cnt;
        char b,c;
    };
    struct person a[10001];
    int main()
    {
        int i,n,j;
        long long sum=0;
        cin>>n;
        for(i=1;i<=n;i++)
        {
            cin>>a[i].name>>a[i].qm>>a[i].py>>a[i].b>>a[i].c>>a[i].sl;
            v[i]=i;
            a[i].cnt=0;
        }
        for(i=1;i<=n;i++)
        {
            if(a[i].qm>80 and a[i].sl>=1) a[i].cnt+=8000;
            if(a[i].qm>85 and a[i].py>80) a[i].cnt+=4000;
            if(a[i].qm>90) a[i].cnt+=2000;
            if(a[i].qm>85 and a[i].c=='Y') a[i].cnt+=1000;
            if(a[i].py>80 and a[i].b=='Y') a[i].cnt+=850;
        }
        for(i=1;i<=n;i++)
            sum+=a[i].cnt;
        for(i=1;i<n;i++)
        {
            for(j=i+1;j<=n;j++)
            {
                if(a[i].cnt<a[j].cnt)
                    swap(a[i],a[j]);
                if(a[i].cnt==a[j].cnt and v[i]>v[j])
                    swap(a[i],a[j]);
            }
        }
        cout<<a[1].name<<endl;
        cout<<a[1].cnt<<endl;
        cout<<sum;
        return 0;
    }
    
  • 0
    @ 2020-02-09 20:47:18
    #include <stdio.h>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    struct stu {
        int id;
        char name[100];
        int qm,py;
        char gb,xb;
        int lw,jj;
    }a[110];
    int jxj (int qm,int py,char gb,char xb,int lw) {
        int jj=0;
        if (qm>80&&lw>=1) jj+=8000;
        if (qm>85&&py>80) jj+=4000;
        if (qm>90) jj+=2000;
        if (qm>85&&xb=='Y') jj+=1000;
        if (py>80&&gb=='Y') jj+=850;
        return jj;
    }
    bool operator <(const stu &p1,const stu &p2) {
        if (p1.jj!=p2.jj) return p1.jj<p2.jj;
        return p1.id>p2.id; 
    }
    int main () {
        int n,i,zq=0;
        scanf ("%d",&n);
        for (i=0;i<n;i++) {
            scanf ("%s%d%d %c %c%d",
            a[i].name,&a[i].qm,&a[i].py,&a[i].gb,&a[i].xb,&a[i].lw);
            a[i].jj=jxj(a[i].qm,a[i].py,a[i].gb,a[i].xb,a[i].lw);
            a[i].id=i+1;
            zq+=a[i].jj;
        }
        sort (a,a+n);
        printf ("%s\n",a[i-1].name);
        printf ("%d\n",a[i-1].jj);
        printf ("%d",zq);
        return 0;
    }
    
  • 0
    @ 2019-12-01 16:47:08
    some_stu = []
    money_max = 0
    money_count = 0
    money_name = '0'
    for i in range(int(input())):
        some_stu.append((input().split()))
    for item in some_stu:
        money = 0
        money += 8000 if int(item[1]) > 80 and int(item[5]) >= 1 else 0
        money += 4000 if int(item[1]) > 85 and int(item[2]) > 80 else 0
        money += 2000 if int(item[1]) > 90 else 0
        money += 1000 if int(item[1]) > 80 and item[4] == 'Y' else 0
        money += 850 if int(item[2]) > 80 and item[3] == 'Y' else 0
        money_count += money
        if money > money_max:
            money_name = item[0]
            money_max = money
    print(money_name)
    print(money_max)
    print(money_count)
    
    

    python 不知道错哪了

  • 0
    @ 2019-11-20 22:13:19

    这里用到了结构数组动态分配内存大家可以看看
    #include<iostream>
    #include<string>
    #include<malloc.h>
    #define LEN sizeof(struct Student)
    using namespace std;
    struct Student{
    char name[100];
    int gard_exam;
    int gard_evaluate;
    char student_leader[1];
    int nums_paper;
    char student_west[1];

    };

    int main(){
    int n;
    cin >> n;
    struct Student *stu=NULL;
    stu = (struct Student *)malloc(sizeof(struct Student)*n);
    for (int i = 0; i < n; i++){
    cin >> stu[i].name >> stu[i].gard_exam >> stu[i].gard_evaluate >> stu[i].student_leader >> stu[i].student_west >> stu[i].nums_paper;
    }
    int sum_grad=0;
    int max_grad = 0;
    string name_cout;
    for (int i = 0; i < n; i++){
    int t_grad = 0;
    if (stu[i].gard_exam > 80 && stu[i].nums_paper >= 1){
    t_grad += 8000;
    }
    if (stu[i].gard_exam > 85 && stu[i].gard_evaluate > 80){
    t_grad += 4000;
    }
    if (stu[i].gard_exam > 90){
    t_grad += 2000;
    }
    if (stu[i].gard_exam > 85 && stu[i].student_west[0]=='Y'){
    t_grad += 1000;
    }
    if (stu[i].gard_exam > 80 && stu[i].student_leader[0] == 'Y'){
    t_grad += 850;
    }
    sum_grad = sum_grad+t_grad;
    if (max_grad < t_grad){
    max_grad = t_grad;
    name_cout = stu[i].name;
    }
    }
    cout << name_cout << endl;
    cout << max_grad << endl;
    cout << sum_grad << endl;
    }

  • 0
    @ 2019-09-27 19:41:51

    暴力模拟,大H2O题目
    祝大家全AC

    
    #include<bits/stdc++.h>
    #define FOR(i,n,m) for(int i=n;i<=m;i++)
    using namespace std;
    struct student{
        string name;
        int endtest,classtest,stu,west,lw,money;
    }a[105];
    int n,allmoney,ans=0,now=0;
    int main()
    {
        char s,w;
        cin>>n;
        FOR(i,1,n)
        {
            cin>>a[i].name;
            cin>>a[i].endtest>>a[i].classtest;
            cin>>s>>w>>a[i].lw;
            if(s=='Y')
            a[i].stu=1;
            else
            a[i].stu=0;//是否是学生干部 
            
            if(w=='Y')
            a[i].west=1;
            else
            a[i].west=0;//是否是西部学生 
            
            //开始颁发奖学金 
            if(a[i].endtest>80&&a[i].lw>=1)
            a[i].money+=8000;//院士奖学金
            
            if(a[i].endtest>85&&a[i].classtest>80)
            a[i].money+=4000;//五四奖学金
            
            if(a[i].endtest>90)
            a[i].money+=2000;//成绩优秀奖
            
            if(a[i].endtest>85&&a[i].west==1)
            a[i].money+=1000;//西部奖学金
            
            if(a[i].classtest>80&&a[i].stu==1)
            a[i].money+=850;//班级贡献奖
            
            allmoney+=a[i].money;//计算发出奖学金总和    
            
            if(now<a[i].money)
            {
                now=a[i].money;
                ans=i;
            }//查找奖学金最高者 
        }
    
    
        cout<<a[ans].name<<'\n'<<a[ans].money<<'\n'<<allmoney;
        return 0;
    }
    
  • 0
    @ 2019-08-18 15:02:51

    分析一下思路:
    1. 输入各类数据
    2. 算出每个人的奖金数,注意,在算的时候要使用if-if,不能使用if-else if - else结构,因为每个人都可以领多个奖学金,所以有些人符合多个条件
    3. 遍历数组,寻找最多奖学金,求出全部奖金和
    4. 输出有最多奖学金的人,最多的奖学金,以及总共奖学金

    /*
        @createTime 2019.2.10
        @Author C++语言学习者青云
        @problemName 谁拿了最多奖学金
    */
    #include <iostream>
    using namespace std;
    
    int main()
    {
        
        int a;
        cin >> a;
        string name[a];
        int score[a];
        int pingyi[a];
        char ganbu[a];
        char xibu[a];
        int lunwen[a];
        int money[a];
        int w = 0,maxmoney = 0,allmoney = 0;
        for(int i = 0;i < a;i++)
        {
            cin >> name[i] >> score[i] >> pingyi[i] >> ganbu[i] >> xibu[i] >> lunwen[i];
        }
        for(int i = 0;i < a;i++)
        {
            money[i] = 0;
            if(score[i] > 80 && lunwen[i] >= 1)
            {
                money[i] += 8000;
            }
            if(score[i] > 85 && pingyi[i] > 80)
            {
                money[i] += 4000;
            }
            if(score[i]> 90)
            {
                money[i] += 2000;
            }
            if(score[i] > 85 && xibu[i] == 'Y')
            {
                money[i] += 1000;
            }
            if(pingyi[i] > 80 && ganbu[i] == 'Y')
            {
                money[i] += 850;
            }
            allmoney += money[i]; 
        }
        for(int i = 0;i < a;i++)
        {
            if(maxmoney < money[i])
            {
                maxmoney = money[i];
                w = i;
            }
        }
        cout << name[w] << endl << maxmoney << endl << allmoney;
        return 0;
    }
    

    一道很不错的模拟题,祝大家全部AC
    最后吐槽一句:这是什么学校?发这么多奖学金?

信息

ID
1001
难度
5
分类
模拟 点击显示
标签
递交数
35519
已通过
11744
通过率
33%
被复制
45
上传者