题解 | 求两个多项式的和

#include<iostream>
#include<algorithm>
using namespace std;

struct node{
    int x;
    int idex;
};
node num1[1000];
node num2[1000];
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int a,b;
        cin>>a>>b;
        num1[i].x=a;
        num1[i].idex=b;
    }
    int m;
    cin>>m;
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        num2[i].x=a;
        num2[i].idex=b;
    }
    int i=0,j=0;
    while(i<n||j<m){
        if(num1[i].idex>num2[j].idex){
            cout<<num1[i].x<<" "<<num1[i].idex<<" ";
            i++;
        }
        else if(num1[i].idex<num2[j].idex){
            cout<<num2[j].x<<" "<<num2[j].idex<<" ";
            j++;
        }
        else{
            if(num1[i].x+num2[j].x==0){
                i++,j++;
                continue;

            }
            cout<<num1[i].x+num2[j].x<<' '<<num1[i].idex<<' ';
            i++,j++;  
        }
    }
    while(i<n){
        cout<<num1[i].x<<" "<<num1[i].idex<<" ";
        i++;
    }
    while(j<m){
        cout<<num2[j].x<<" "<<num2[j].idex<<" ";
        j++;
    }
}