(PAT)1002 A+B for Polynomials

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.Scanner;
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String first[];
        String second[];
        String result[] = new String[20];
        int index =0 ;
        double total ;
        int firstFlag;
        int secondFlag;
        int firstlength = sc.nextInt()*2;
        first = new String[firstlength];
        for(int i=0;i<firstlength;i++){
            first[i] = sc.next();
        }
        int secondlength = sc.nextInt()*2;
        second= new String[secondlength];
        for(int i=0;i<secondlength;i++){
            second[i] = sc.next();
        }
        for(int i=0;i<10;i++){
            firstFlag = -1;
            secondFlag = -1;
            for(int j =0;j<first.length;j=j+2){
                if(i == Integer.parseInt(first[j])){
                        firstFlag = j;
                }
            }
            for(int k = 0;k<second.length;k=k+2){
                if(i==Integer.parseInt(second[k])){
                    secondFlag = k;
                }
            }
            if(firstFlag != -1 || secondFlag != -1){
                if(firstFlag!=-1 && secondFlag != -1){
                    total = Double.parseDouble(first[firstFlag+1]) + Double.parseDouble(second[secondFlag+1]);
                    if(total!=0) {
                        result[index] = String.valueOf(i);
                        index++;
                        result[index] = String.valueOf(String.format("%.1f", total));
                        index++;
                    }
                }else{
                    if(firstFlag != -1){
                        total = Double.parseDouble(first[firstFlag+1]);
                        if(total!=0) {
                            result[index] = String.valueOf(i);
                            index++;
                            result[index] = String.valueOf(String.format("%.1f", total));
                            index++;
                        }
                    }else{
                        total = Double.parseDouble(second[secondFlag+1]);
                        if(total!=0) {
                            result[index] = String.valueOf(i);
                            index++;
                            result[index] = String.valueOf(String.format("%.1f", total));
                            index++;
                        }
                    }
                }
            }
        }
        String output = String.valueOf(index/2);
        for(int i=1000;i>=0;i--){
            for(int k=0;k<result.length;k=k+2){
                if(result[k]!=null){
                    if(Integer.parseInt(result[k])==i){
                        output = output+" "+result[k]+" "+result[k+1];
                    }
                }
            }
        }
        System.out.print(output);
    }
}