1047. Student List for Course (25)-PAT
2013-08-09 14:05
681 查看
1047. Student List for Course (25)
时间限制400 ms内存限制64000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueZhejiang University has 40000 students and provides 2500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.Input Specification:Each input file contains one test case. For each case, the first line contains 2 numbers: N (<=40000), the total number of students, and K (<=2500), the total number of courses. Then N lines follow, each contains a student's name (3 capital English lettersplus a one-digit number), a positive number C (<=20) which is the number of courses that this student has registered, and then followed by C course numbers. For the sake of simplicity, the courses are numbered from 1 to K.Output Specification:For each test case, print the student name lists of all the courses in increasing order of the course numbers. For each course, first print in one line the course number and the number of registered students, separated by a space. Then output the students'names in alphabetical order. Each name occupies a line.Sample Input:10 5 ZOE1 2 4 5 ANN0 3 5 2 1 BOB5 5 3 4 2 1 5 JOE4 1 2 JAY9 4 1 2 5 4 FRA8 3 4 2 5 DON2 2 4 5 AMY7 1 5 KAT3 3 5 4 2 LOR6 4 2 4 1 5Sample Output:
1 4 ANN0 BOB5 JAY9 LOR6 2 7 ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR6 3 1 BOB5 4 7 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1 5 9 AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
推荐指数:※
来源:http://pat.zju.edu.cn/contests/pat-a-practise/1047
注意cin的使用吧,改成scanf直接过。。。
#include<iostream> #include<string> #include<vector> #include<string.h> #include<stdlib.h> #include<stdio.h> #include<algorithm> using namespace std; typedef struct stu{ char name[5]; }stu; stu *st; bool compare(int a,int b){ return strcmp(st[a].name,st[b].name)<0; } int main() { int n,k;//students,courses cin>>n>>k; st=new stu ; vector< vector<int> > cour(k+1); int i,j,num,tmp_cour; for(i=0;i<n;i++){ scanf("%s",st[i].name); scanf("%d",&num); for(j=0;j<num;j++){ scanf("%d",&tmp_cour); cour[tmp_cour].push_back(i); } } for(i=1;i<=k;i++){ printf("%d %d\n",i,cour[i].size()); sort(cour[i].begin(),cour[i].end(),compare); for(j=0;j<cour[i].size();j++) printf("%s\n",st[cour[i][j]].name); } return 0; }
相关文章推荐
- 1047. Student List for Course (25)【排序】——PAT (Advanced Level) Practise
- 【C++】PAT(advanced level)1047. Student List for Course (25)
- 1047. Student List for Course (25)-PAT甲级真题
- PAT (Advanced Level) Practise 1047 Student List for Course (25)
- PAT (Advanced Level) Practise 1047 Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1039. Course List for Student (25)【排序】——PAT (Advanced Level) Practise
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- Pat(Advanced Level)Practice--1047(Student List for Course)
- 1039. Course List for Student (25)-PAT甲级真题
- 【PAT 1047】Student List for Course
- 1047. Student List for Course (25)
- 1039. Course List for Student (25)PAT甲级
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 【C++】PAT(advanced level)1039. Course List for Student (25)