九度 oj 题目1005：Graduate Admission

最新推荐文章于 2017-10-24 20:51:29 发布

guojiaqi007

最新推荐文章于 2017-10-24 20:51:29 发布

阅读量332

点赞数

分类专栏： oj 九度模拟文章标签： oj 九度模拟

oj 同时被 3 个专栏收录

63 篇文章

订阅专栏

九度

62 篇文章

订阅专栏

模拟

15 篇文章

订阅专栏

本文介绍了一个基于C++的大学招生系统的实现过程。该系统能够处理学生的报名信息，并根据设定的规则进行排序和录取。系统使用了结构体、向量等数据结构及排序算法来高效完成任务。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://ac.jobdu.com/problem.php?pid=1005

参考了 http://blog.youkuaiyun.com/abcjennifer/article/details/7292011

#include <stdio.h>
#include <vector>
#include <cstring>
#include <algorithm>

typedef struct applicant{ 
    int ge,gi,choice[6],id; 
    friend bool operator < (struct applicant a, struct applicant b){ 
        int aSum = a.ge + a.gi;
        int bSum = b.ge + b.gi;
        return aSum != bSum?  aSum > bSum:a.ge > b.ge;
    }  
} App; 


int main(){ 
    //freopen("in/1005.in","r",stdin); 
    int n,m,k; 
    App apps[40001];
    int quota[101];
    int bar[101][2];
    std::vector<int> enrollList[101];
    while(scanf("%d%d%d",&n,&m,&k)!=EOF){ 
        for (int i = 0; i < 101; ++i) enrollList[i].clear(); 
        memset(bar,0,sizeof(bar) ); 
        for (int i = 0; i < m; ++i)  
            scanf("%d","a[i]);  
        for (int i = 0; i < n; ++i) { 
            scanf("%d%d",&apps[i].ge,&apps[i].gi);  
            apps[i].id = i;
            for (int j = 0; j < k; j++) { 
                scanf("%d", &apps[i].choice[j]);  
            } 
        } 
        std::sort(apps,apps+n); 


        for (int i = 0;  i < n; ++i) { 
            for (int j = 0;  j< k; ++j) { 
                int univ = apps[i].choice[j];
                if( (bar[univ][0] == apps[i].ge&&bar[univ][1] == apps[i].gi)
                        ||quota[univ] > 0){ 
                    quota[univ]--;
                    enrollList[univ].push_back(apps[i].id);
                    bar[univ][0] = apps[i].ge;
                    bar[univ][1] = apps[i].gi;
                    break;

                }   
            }   
        }  

        for (int i = 0; i < m; ++i) { 
            std::sort(enrollList[i].begin(),enrollList[i].end());  
            int l = (int) enrollList[i].size();
            bool first = true;
            for (int j = 0; j < l ; ++j) { 
                 if(first){ 
                     printf("%d",enrollList[i][(unsigned)j]); 
                     first = false;
                 }else{ 
                     printf(" %d",enrollList[i][(unsigned)j]);  
                 }      
            }
            printf("\n"); 
        } 

    }  
    return 0;

}