PAT 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

 import java.util.LinkedList;
 import java.util.Queue;
 import java.util.Scanner;

 public class Main {
     public static void main(String[] args) {
         Queue<A> q1 = new LinkedList<A>();
         Queue<A> q2 = new LinkedList<A>();
         Queue<A> q3 = new LinkedList<A>();
         Scanner input = new Scanner(System.in);
         int n = input.nextInt();
         for(int i=0;i<n;i++){
             A a = new A();
             a.a = input.nextInt();
             a.b = input.nextDouble();
             q1.add(a);
         }
         int m = input.nextInt();
         for(int i=0;i<m;i++){
             A a = new A();
             a.a = input.nextInt();
             a.b = input.nextDouble();
             q2.add(a);
         }
         while(!q1.isEmpty()&&!q2.isEmpty()){
             int a1 = q1.peek().a;
             double b1 = q1.peek().b;
             int a2 = q2.peek().a;
             double b2 = q2.peek().b;
             A a = new A();
             if(a1==a2){
                 a.a = a1;
                 a.b = b1+b2;
                 q1.poll();
                 q2.poll();
             }if(a1>a2){
                 a.a = a1;
                 a.b = b1;
                 q1.poll();
             }if(a1<a2){
                 a.a = a2;
                 a.b = b2;
                 q2.poll();
             }
             if(a.b!=0)
                 q3.add(a);
         }
         while(!q1.isEmpty()){
             q3.add(q1.poll());
         }
         while(!q2.isEmpty()){
             q3.add(q2.poll());
         }
         System.out.print(q3.size());

         while(!q3.isEmpty()){
             System.out.print(" "+q3.peek().a+" ");
             System.out.printf("%.1f",q3.peek().b);
             q3.poll();
         }

     }
 }
 class A{
     int a;
     double b;
 }