pat 1036. Boys vs Girls (25)
1036. Boys vs Girls (25)
This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.
Input Specification:
Each input file contains one test case. Each case contains a positive integer N, followed by N lines of student information. Each line contains a student's name, gender, ID and grade, separated by a space, where name and ID are strings of no more than 10 characters with no space, gender is either F (female) or M (male), and grade is an integer between 0 and 100. It is guaranteed that all the grades are distinct.
Output Specification:
For each test case, output in 3 lines. The first line gives the name and ID of the female student with the highest grade, and the second line gives that of the male student with the lowest grade. The third line gives the difference gradeF-gradeM. If one such kind of student is missing, output "Absent" in the corresponding line, and output "NA" in the third line instead.
Sample Input 1:
3 Joe M Math990112 89 Mike M CS991301 100 Mary F EE990830 95Sample Output 1:
Mary EE990830 Joe Math990112 6Sample Input 2:
1 Jean M AA980920 60Sample Output 2:
Absent Jean AA980920 NA
代码:
<span style="font-family:SimSun;font-size:10px;">#include<iostream> #include<cstdlib> #include<cstdio> using namespace std; struct students { string name; string sex; string k; int grade; }; int main() { int n; while(scanf("%d",&n)==1) { students *stu=new students[n+1]; int pp=0,grade1=101,qq=0,grade2=-1,g1=0,g2=0; for(int i=0;i<n;i++) { cin>>stu[i].name>>stu[i].sex>>stu[i].k>>stu[i].grade; if(stu[i].sex[0]=='M') { g1=1; if(stu[i].grade<grade1) { grade1=stu[i].grade; pp=i; } } if(stu[i].sex[0]=='F') { g2=1; if(stu[i].grade>grade2) { grade2=stu[i].grade; qq=i; } } } if(g2==0) cout<<"Absent"<<endl; else cout<<stu[qq].name<<" "<<stu[qq].k<<endl; if(g1==0) cout<<"Absent"<<endl; else cout<<stu[pp].name<<" "<<stu[pp].k<<endl; if(g1==0||g2==0) cout<<"NA"<<endl; else cout<<stu[qq].grade-stu[pp].grade<<endl; } }</span>
版权声明:本文为博主原创文章,未经博主允许不得转载。
posted on 2015-07-18 15:23 Tob__yuhong 阅读(159) 评论(0) 编辑 收藏 举报