[编程入门]链表合并

#include<stdio.h>

#include<stdlib.h>

typedef struct st {

int num;

int score;

struct st* next;

}stu;

stu* create(int n);

void print(stu* first);

stu* sort(stu* first);

int main() {

int n, m;

scanf("%d", &n);

scanf("%d", &m);

stu* p1, *p2, *first;

p1 = first = create(n);

p2 = create(m);

while (p1->next != NULL) {

p1 = p1->next;

}

p1->next = p2->next;

first = sort(first);

first = first->next;

print(first);

return 0;

}

stu* create(int n) {

stu* head, * node;

head = (stu*)malloc(sizeof(stu));

node = head;

for (int i = 0; i < n; i++) {

stu* a = (stu*)malloc(sizeof(stu));

scanf("%d%d", &a->num, &a->score);

a->next = NULL;

node->next = a;

node = a;

}

return head;

}

void print(stu* first) {

while (first != NULL) {

printf("%d %d\n", first->num, first->score);

first = first->next;

}

}

stu* sort(stu* first) {

stu* q = first, *min, *temp;

int t;

min = q->next;

q = q->next;

while (q != NULL) {

temp = q->next;

while (temp != NULL) {

if (temp->num < min->num) {

min = temp;

}

temp = temp->next;

}

t = q->num;

q->num = min->num;

min->num = t;

t = q->score;

q->score = min->score;

min->score = t;

q = q->next;

}

return first;

}