这题数据范围没标，但是是不是可以用类似桶排序做？（20Pts)

#include<bits/stdc++.h>
using namespace std;
map<int, bool>a, b;
int as, bs, f, len;
void d() {
	for (int i = 0; i < len; i++) {
		if (a[i] != b[i]) {
			cout << 0 << '\n';
			return;
		}
	}
	cout << 1 << '\n';
	return;
}
void z() {
	for (int i = 0; i < len; i++) {
		if (a[i] && (!b[i])) {
			cout << 0 << '\n';
			return;
		}
	}
	cout << 1 << '\n';
}
int main() {
	cin >> as;
	for (int i = 0; i < as; i++) {
		cin >> f;
		a[f] = true;
	}
	cin >> bs;
	for (int i = 0; i < bs; i++) {
		cin >> f;
		b[f] = true;
	}
	len = max(as, bs);
	cout << as << '\n';
	for (int i = 0; i < len; i++) {
		if (a[i] && b[i]) {
			cout << i << ' ';
		}
	}
	cout << '\n';
	for (int i = 0; i < len; i++) {
		if (a[i] || b[i]) {
			cout << i << ' ';
		}
	}
	cout << '\n';
	for (int i = 0; i < 64; i++) {
		if (!a[i]) {
			cout << i << ' ';
		}
	}
	cout <<'\n';
	d();
    z();
    if(a[0]){
		cout<<1;
	}else{
		cout<<0;
	}
}