[蓝桥杯]算法提高 GPA

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<cstring>
 5 
 6 using namespace std;
 7 double gpa[2];
 8 
 9 int main(){
10     int n, p, cnt = 2;
11     
12     for(int j = 0 ; j < 2 ; j++){
13         double ans1 = 0, ans2 = 0;
14         cin >> n;
15         for(int i = 0 ; i < n ; i++){
16             char q[3];
17             scanf("%d %s", &p, q);
18         
19             if(q[0] != ‘P‘ && q[0] != ‘N‘){
20                 int aa = 0;
21                 for(int k = 0 ; k < 3 ; k++){
22                     if(q[k] >= ‘0‘ && q[k] <= ‘9‘){
23                         int tt = q[k] - ‘0‘;
24                         aa = aa * 10 + tt;
25                     }
26                 }
27                 ans1 += p * aa;
28                 ans2 += p;
29             }
30         }
31         gpa[j] = ans1 / ans2;
32     }
33     
34     double res = gpa[0] - gpa[1];
35     if(res >= 0.01 || res <= -0.01)  printf("%.2lf\n", res);
36     else  cout << "0.00" << endl;
37     
38     return 0;
39 }