不用链表合并

参考代码:

#include<iostream>

#include<map>

#include<vector>

#include<algorithm>

using namespace std;

map<int, int> ma;

typedef struct node

{

int data1;

int data2;

struct node* next;

}node;

int main()

{

int a, b, c;

cin >> a >> b;

c = a + b;

node* head = new node();

head->next = NULL;

node* last = head;

while (c--)

{

cin >> a >> b;

ma[a] = b;

}

vector<pair<int, int>> ne(ma.begin(), ma.end());

sort(ne.begin(), ne.end());

for (auto i = ne.begin(); i != ne.end(); i++)

{

node* temp = new node();

temp->next = NULL;

temp->data1 = i->first;

temp->data2 = i->second;

last->next = temp;

last = temp;

}

head = head->next;

while (head != NULL)

{

cout << head->data1 <<" " << head->data2 << endl;

head = head->next;

}

return 0;

}