PTA 乙级 1065 单身狗

我没有直接用qsort()函数，昨天学到了一个自定义快排，今天试用了一下。

代码实现：

#include<stdio.h>
#include<stdlib.h>

void quick_sort(int *a, int l, int r)
{
	if (l < r)
	{
		int i = sort_array(a, l, r);
		quick_sort(a, l, i - 1);
		quick_sort(a, i + 1, r);
	}
}

int sort_array(int *a, int l, int r)
{
	int i = l, j = r;
	int x = a[i];

	while (i < j)
	{
		while (i < j&&a[j] >= x)
			j--;
		if (i < j)
			a[i] = a[j];
		while (i < j&&a[i] < x)
			i++;
		if (i < j)
			a[j] = a[i];
	}
	a[i] = x;

	return i;
}

int main()
{
	int *marry, *present, *alone, N, M, cnt = 0;

	marry = (int*)malloc(sizeof(int) * 100000);
	present = (int*)malloc(sizeof(int) * 100000);
	alone = (int*)malloc(sizeof(int) * 100000);
	for (int i = 0; i < 100000; i++)marry[i] = -1, present[i] = -1;
	scanf("%d", &N);
	for (int i = 0; i < N; i++)
	{
		int husbend, wife;
		scanf("%d %d", &husbend, &wife);
		marry[husbend] = wife, marry[wife] = husbend;
	}
	scanf("%d", &M);
	for (int i = 0; i < M; i++)
	{
		int name;
		scanf("%d", &name);
		present[name] = 1;
	}
	for (int i = 0; i < 100000; i++)
		if (present[i] == 1 && marry[i] == -1)
			alone[cnt++] = i;
		else if (present[i] == 1 && marry[i] != -1 && present[marry[i]] == -1)
			alone[cnt++] = i;
	quick_sort(alone, 0, cnt - 1);
	printf("%d\n", cnt);
	for (int i = 0; i < cnt; i++)
		if (i == 0)printf("%05d", alone[i]);
		else printf(" %05d", alone[i]);

	return 0;
}