#includeusing namespace std; struct node{ string x, y; int grade; }f[1010],m[1010]; bool cmp1(node x1, node x2){ return x1.grade < x2.grade; } bool cmp2(node x1, node x2){ return x1.grade > x2.grade; } int main(){ int n, ret1 = 0, ret2 = 0, f1 = 0; cin >> n; while(n--){ char a; int b; string x, y; cin >> x >> a >> y >> b; if(a == 'F'){ f[ret1].x = x; f[ret1].y = y; f[ret1].grade = b; ret1++; } else{ m[ret2].x = x; m[ret2].y = y; m[ret2].grade = b; ret2++; } } sort(f, f + ret1, cmp2); sort(m, m + ret2, cmp1); if(ret1 == 0) f1 = 1, cout << "Absent" << endl; else cout << f[0].x << " " << f[0].y << endl; if(ret2 == 0) f1 = 1, cout << "Absent" << endl; else cout << m[0].x << " " << m[0].y << endl; if(f1) cout << "NA"; else cout << f[0].grade - m[0].grade ; }
刷题日常



