【桶】惊人的记忆力

---

思路：

桶排序搞一搞其实很简单

---

$Code$:

#include <cstdio>
#include <iostream>
#define CWH using
#define AK namespace
#define IOI std
CWH AK IOI;
int n,m,x,a[10001];

int main()
{
	freopen("a.in","r",stdin);freopen("a.out","w",stdout);
	scanf ("%d",&n);
	for (int i = 1; i <= n; ++i)
	{
	  scanf("%d",&x);
	  a[x + 1000]++;
    }
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
	{
	  scanf("%d",&x);
	  a[x + 1000]++;//桶
    }
    for (int i = -1000; i <= 1000; ++i)
    if (a[i + 1000]) printf("%d ",i);//从小到大输出
}