zoukankan      html  css  js  c++  java
  • PAT 1036 Boys vs Girls

    #include <cstdio>
    #include <iostream>
    #include <cstdlib>
    #include <algorithm>
    
    using namespace std;
    
    class Stu {
        public:
            char name[12];
            char id[12];
            int grade;
            char gender;
    };
    
    bool my_cmp(const Stu* a, const Stu* b) {
        return a->grade < b->grade;
    }
    
    void print (vector<Stu*> &stu) {
        int len = stu.size();
        for (int i=0; i<len; i++) {
            printf("%s %d
    ", stu[i]->name, stu[i]->grade);
        }
    }
    
    int main() {
        vector<Stu*> male;
        vector<Stu*> female;
        int n = 0;
        scanf("%d", &n);
        
        for (int i=0; i<n; i++) {
            Stu* p = new Stu();
            scanf("%s %c %s %d", p->name, &(p->gender), p->id, &(p->grade));
            
            if (p->gender == 'M') {
                male.push_back(p);
            } else {
                female.push_back(p);
            }
        }
        sort(male.begin(), male.end(), my_cmp);
        sort(female.begin(), female.end(), my_cmp);
    
        Stu* best = NULL;
        Stu* worst= NULL;
        
        if (female.empty()) {
            printf("Absent
    ");
        } else {
            best = female[female.size() - 1];
            printf("%s %s
    ", best->name, best->id);
        }
        if (male.empty()) {
            printf("Absent
    ");
        } else {
            worst = male[0];
            printf("%s %s
    ", worst->name, worst->id);
        }
        if (worst == NULL || best == NULL) {
            printf("NA
    ");
        } else {
            printf("%d", best->grade - worst->grade);
        }
        return 0;
    }

    我感觉自己已经成脑残了,竟然忘了传my_cmp

  • 相关阅读:
    组合数计算--动态规划
    ListView 的position和id的区别
    android View 关于transient
    BlockingQueue深入分析
    栈的实现(JAVA)
    队列的实现(JAVA)
    《算法导论》读书笔记之第11章 散列表
    java 二叉搜索树
    桶排序
    排序算法的稳定性
  • 原文地址:https://www.cnblogs.com/lailailai/p/4066008.html
Copyright © 2011-2022 走看看