Coder-Strike 2014 - Finals (Div. 2) A. Pasha and Hamsters

超简单的贪心题，就不用多说了吧...

先处理好第一个人的，在处理第二个人的，如果二者喜欢同一个苹果，给第一个人

代码如下：

#include <map>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define esp 1e-9
#define MAXN 10010
#define ll long long
#define INF 0x7FFFFFFF
#define BUG system("pause")
#define SW(a,b) a^=b;b^=a;a^=b;
using namespace std;
int apple[MAXN];
int main(void){
	int n, a, b;
	while(cin >> n >> a >> b){
		int Arlikes, Allikes;
		for(int i=0; i<a; ++i){
			cin >> Arlikes;
			apple[Arlikes] = 1;
		}
		for(int i=0; i<b; ++i){
			cin >> Allikes;
			if(apple[Allikes] != 1){
				apple[Allikes] = 2;
			}
		}
		printf("%d", apple[1]);
		for(int i=2; i<=n; ++i){
			printf(" %d", apple[i]);
		}
	}

	return 0;
}