PAT甲级1002 A+B for Polynomials 25

1002 A+B for Polynomials 25

1002 A+B for Polynomials (25 分)
This time, you are supposed to find A+B where A and B are two polynomials.

Input Specification:
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

K N
1
​
a
N
1
​

​
N
2
​
a
N
2
​

​
… N
K
​
a
N
K
​

​

where K is the number of nonzero terms in the polynomial, N
i
​
and a
N
i
​

​
(i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N
K
​
<⋯<N
2
​
<N
1
​
≤1000.

Output Specification:
For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output:
3 2 1.5 1 2.9 0 3.2

#include<iostream>
using namespace std;

int main(){
	float c[1005]={0};
	int x1,y;	//多项式个数，指数
	float num;
	scanf("%d",&x1);
	for(int i=0;i<x1;i++){
		scanf("%d%f",&y,&num);
		c[y]+=num;
	} 
//	for(int i=0;i<1005;i++){
//		if(c[i]!=0.0){
//			printf("%d %.1f\n",i,c[i]);
//		}
//	}
	
	int x2;
	scanf("%d",&x2);
	for(int i=0;i<x2;i++){
		scanf("%d%f",&y,&num);
		c[y]+=num;
	}
	int count=0;
	for(int i=0;i<1005;i++){
		if(c[i]!=0){
			count++;
		}
	}
	printf("%d",count);
	for(int i=1004;i>=0;i--){
		if(c[i]!=0.0){
			printf(" %d %.1f",i,c[i]);
		}
	}
	
	return 0;
}

得分：2分—格式错误–原因未知

参考答案

#include <iostream>
using namespace std;
int main() {
    float c[1001] = {0};
    int m, n, t;
    float num;
    scanf("%d", &m);
    for (int i = 0; i < m; i++) {
        scanf("%d%f", &t, &num);
        c[t] += num;
    }
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%d%f", &t, &num);
        c[t] += num;
    }
    int cnt = 0;
    for (int i = 0; i < 1001; i++) {
        if (c[i] != 0) cnt++;
    }
    printf("%d", cnt);
    for (int i = 1000; i >= 0; i--) {
        if (c[i] != 0.0)
            printf(" %d %.1f", i, c[i]);
    }
    return 0;
}