Sicily-polynomial addition

多项式合并，我是利用桶排序来完成的。

可能比较复杂。

#include <iostream> 
#include <string>
#include <cstring>
using namespace std;
int main() {
    int m;
    cin >> m;
    while(m--) {
        int poly[10001] = {0};
        int N1;
        cin >> N1;
        while(N1--) {
            int k;
            int n;
            cin >> k >> n;
            poly[n] = k;
        }
        int N2;
        cin >> N2;
        while(N2--) {
            int j;
            int m;
            cin >> j >> m;
            poly[m] += j;
        }
        int count = 0;
        for (int i = 10000; i >= 0; i--) {
            if (poly[i]!=0) {
                count++;
            }
        }
        cout << count << endl;
        for (int i = 10000; i >= 0; i--) {
            if (poly[i]!=0) {
                cout << poly[i] << " " << i << endl;
            }
        }
    }
    return 0;
}