#include<iostream>
#include<stdlib.h>
#include<string.h>
using namespace std;
typedef struct node
{
int num;
int score;
struct node *next;
}Node;
Node *creatNode(int num,int score)
{
Node *newNode=(Node*)malloc(sizeof(Node));
newNode->num=num;
newNode->score=score;
newNode->next=NULL;
return newNode;
}
Node *insertNode(Node *head,Node *newNode)
{
if(head==NULL)
{
return newNode;
}
if(head->num>newNode->num)
{
newNode->next=head;
return newNode;
}
Node *current=head;
while(current->next!=NULL&¤t->next->num<=newNode->num)
{
current=current->next;
}
newNode->next=current->next;
current->next=newNode;
return head;
}
void print(Node *head)
{
while(head!=NULL)
{
cout<<head->num<<endl;
cout<<head->score<<endl;
head=head->next;
}
}

int main()
{
int n,m,num,score;
Node *listA=NULL;
Node *listB=NULL;
cin>>n;
cin>>m;
/*A*/
for(int i=0;i<n;i++)
{
scanf("%d %d",&num,&score);
Node *newNode=creatNode(num,score);
insertNode(listA,newNode);
}
/*B*/
for(int i=0;i<m;i++)
{
scanf("%d %d",&num,&score);
Node *newNode=creatNode(num,score);
insertNode(listB,newNode);
}
/*ºÏ²¢*/
while(listB)
{
listA=insertNode(listA,creatNode(listB->num, listB->score));
listB=listB->next;
}
print(listA);
return 0;
}

阿里嘎多！

@全体成员

有报错截图吗，优先发报错截图