2012-2013 Waterloo Local Contest Problem D: Course Scheduling 容器的使用

首先亮出题目：

Problem D: Course Scheduling

It is a difficult job to schedule all of the courses in a university to satisfy students' choices with a minimum of conflicts. The task is made all the more difficult when some students don't pre-enroll, or pre-enroll multiple times because they forget that they already did it.

Input Specification

The first line of input contains an integer 0 < n <= 100000, the number of student course requests. Each of the next n lines contains three strings separated by spaces: a student's first and last name, and the course that the student wishes to take. You may assume that each name is a string of at least one and at most 20 upper-case letters, and that a course is a string of at least one and at most 10 upper-case letters and digits. If a student requests a given course more than once, only the first such request should be considered. You may assume that no two students have both their first and last names the same.

Sample Input

1

PINK TIE CS241

Output Specification

For each requested course, output a line containing the course, a space, and the number of students who requested the course. Output the courses sorted in lexicographical order (with digits sorted before letters).

Output for Sample Input

CS241 1

【题意】给出n个学生想要参加的课程，计算每门课的学社总人数。不存在同名又同姓的学生，但可能有一个学生报同一门课两次。最后按字典序输出课程名和参加学生的人数。

【分析】首先处理同名利用map作为关联式数组的特性，来确定是否记录课程。

#include <iostream>
#include <map>

using namespace std;

int main()
{
    int n;
    cin >> n;
    string a,b,c,x;
    map<string,int>student,subject;
    pair<string,int>subpair;
    for(int i=0;i<n;i++){
        cin >> a >> b >> c;
        x=a+' '+b+' '+c;
        if(student[x]==0){
            student[x]++;
            subject[c]++;
        }
    }
    map<string,int>::iterator item;
    for(item=subject.begin();item!=subject.end();item++){
        subpair=*item;
        cout << subpair.first << " " << subpair.second << endl;
    }
    return 0;
}

下面就附上代码不是复杂的题目就不过多论述了。