polynomial

/*
 Author: 曹北健
 Result: AC Submission_id: 4264726
 Created at: Wed Mar 30 2022 22:31:24 GMT+0800 (China Standard Time)
 Problem_id: 5488   Time: 47    Memory: 3216
*/

#include <stdio.h>
long long a1[114514] = { 0 }, a2[114514] = { 0 }, e1[114514] = { 0 }, e2[114514] = { 0 };
int main(){
    int m, n, p = 0, q = 0, i;
    scanf("%d%d", &m, &n);
    for(i = 0; i < m; i++){
        scanf("%lld%lld", a1 + i, e1 + i);
    }
    for(i = 0; i < n; i++){
        scanf("%lld%lld", a2 + i, e2 + i);
    }
    while((p < m) || (q < n)){
        if((p >= m) || ((p < m) && (q < n) && (e1[p] < e2[q]))){
            printf("%lld %lld ", a2[q], e2[q]);//nonzero
            q++;
        }
        else if((q >= n) || ((p < m) && (q < n) && (e1[p] > e2[q]))){
            printf("%lld %lld ", a1[p], e1[p]);//nonzero
            p++;
        }
        else{
            if(a1[p] + a2[q]){
                printf("%lld %lld ", a1[p] + a2[q], e2[q]);
            }
            p++; q++;
        }
    }
    return 0;
}