PAT（甲级）1002 部分正确。不知道错在哪里了求指正鸭~

PAT（甲级）1002 部分正确。不知道错在哪里了求指正鸭~
靴靴各位啦~
比心心♥

#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<queue>
#include<stack>
#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
#define MAXSIZE 30

struct pol {
	int exponents;
	float confficients;
}xp[2][10], x1, x2, ansp[10];

int main() {

	queue<pol> APOL, BPOL, ANSPOL;
	//A\B数据输入
	for (int i = 0; i < 2; i++)
	{
		int num;
		cin >> num;
		for (int j = 0; j < num; j++)
		{
			cin >> xp[i][j].exponents;
			cin >> xp[i][j].confficients;
			if (i == 0)APOL.push(xp[i][j]);
			else BPOL.push(xp[i][j]);
		}
	}
	int ansnum = 0;

	while (!APOL.empty() && !BPOL.empty()) {
		x1 = APOL.front(); x2 = BPOL.front();
		if (x1.exponents == x2.exponents) {
			ansp[ansnum].exponents = x1.exponents;
			ansp[ansnum].confficients = x1.confficients + x2.confficients;
			ANSPOL.push(ansp[ansnum]);
			ansnum++;
			APOL.pop(); BPOL.pop();
		}
		else
		{
			if (x1.exponents > x2.exponents) {
				ansp[ansnum].exponents = x1.exponents;
				ansp[ansnum].confficients = x1.confficients;
				ANSPOL.push(ansp[ansnum]);
				ansnum++;
				APOL.pop();
			}
			else {

				ansp[ansnum].exponents = x2.exponents;
				ansp[ansnum].confficients = x2.confficients;
				ANSPOL.push(ansp[ansnum]);
				BPOL.pop();
			}
		}
	};

	while (!APOL.empty()) {
		x1 = APOL.front();
		ansp[ansnum].exponents = x1.exponents;
		ansp[ansnum].confficients = x1.confficients;
		ANSPOL.push(ansp[ansnum]);
		ansnum++;
		APOL.pop();
	};

	while (!BPOL.empty()) {
		x2 = BPOL.front();
		ansp[ansnum].exponents = x2.exponents;
		ansp[ansnum].confficients = x2.confficients;
		ANSPOL.push(ansp[ansnum]);
		ansnum++;
		BPOL.pop();
	};

	//输出答案
	cout << ansnum + 1 << " ";
	while (!ANSPOL.empty())
	{
		cout << ANSPOL.front().exponents << " " << setprecision(2) << ANSPOL.front().confficients;
		ANSPOL.pop();
		if (!ANSPOL.empty())cout << " ";
		else break;
	}

	return 0;
}