？？？
by TheAurora @ 2019-08-04 17:20:47
#include <bits/stdc++.h>
using namespace std;
struct node {
int a, b;
node *next;
};
void Print(node *p) {
p = p->next; // í·??????′?êy?Y
while(p != NULL) {
cout << p->a << " " << p->b << endl;
p = p->next;
}
}
int main() {
int n, m;
node *h1, *h2, *h3, *p, *q, *l;
cin >> n;
h1 = new node;
p = h1;
for(int i=1; i<=n; i++) {
q = new node;
cin >> q->a >> q->b;
p->next = q;
p = q;
}
p->next = NULL;
cin >> m;
h2 = new node;
p = h2;
for(int i=1; i<=m; i++) {
q = new node;
cin >> q->a >> q->b;
p->next = q;
p = q;
}
p->next = NULL;
h3 = new node;
p = h3;
node *p1, *p2;
p1 = h1->next, p2 = h2->next; // í·??????′?êy?Y
while(p1 != NULL && p2 != NULL) {
q = new node;
if(p1->b > p2->b) {
q->a = p1->a;
q->b = p1->b;
p1 = p1->next;
} else {
if(p1->b < p2->b) {
q->a = p2->a;
q->b = p2->b;
p2 = p2->next;
} else {
if(p1->b == p2->b) {
q->a = p1->a + p2->a;
q->b = p1->b;
p1 = p1->next;
p2 = p2->next;
}
}
}
p->next = q;
p = q;
}
if(p1 != NULL) // á??óé?è￥
p->next = p1;
else if(p2 != NULL) // á??óé?è￥
p->next = p2;
int ans = 0;
p = h3;
while(p != NULL) {
ans ++;
p = p->next;
}
cout << ans-1 << endl; // í·??????′?êy?Y
Print(h3);
return 0;
}
by Skywind @ 2019-08-06 13:36:49
@[Skywind](/space/show?uid=154548) 希望更丰富的展现？使用Markdown
by JeffWang2019 @ 2019-09-06 22:38:40
@[冯敬椿](/space/show?uid=109719) 同学你好 我也是新手，这道题规定当x是1次方的时候，不能输出 x^1的， 应该输出x。
by 春天游泳 @ 2019-09-26 22:36:25
@[Skywind](/space/show?uid=154548)
请不要用[Markdown](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown)语法来强调你头文件的重要性！！！
=
by 天有不测风云 @ 2019-10-03 19:46:42