1002. A+B for Polynomials (25)

This time, you are supposed to find A+B where A and B are two polynomials.

Input

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < ... < N2 < N1 <=1000.

Output

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

---

提交代码

就是一个数组，加进去就好了

刚刚开始的时候，理解错了，要输出count。

#include <iostream>

using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define MAX 1000
double input[MAX+1]={0};


int main(int argc, char** argv) {
	
	int K1;
	int n;
	double a;

	scanf("%d",&K1);
	for(int i=0; i<K1; i++)
	{
		scanf("%d %lf",&n, &a);
		input[n] += a;
	}
	scanf("%d",&K1);
	for(int i=0; i<K1; i++)
	{
		scanf("%d %lf",&n, &a);
		input[n] += a;
	}
	
	int index1=0;
	for(int i=MAX; i>=0; i--)
	{
		if(input[i] != 0)
		{
			index1++;
		}
	}
	printf("%d",index1);
	for(int i=MAX; i>=0; i--)
	{
		if(input[i]!=0)
		{
			printf(" %d %.1lf",i,input[i]);
		}
	}
	cout<<endl;
	
	
	return 0;
}