백준 10816번 : 숫자 카드 2

#include <iostream>
#include <map>
#include <string>

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int N;
	cin >> N;
	map<int, int> numMap;
	for (int i = 0; i < N; i++)
	{
		int num;
		cin >> num;
		auto found = numMap.find(num);
		if (found == numMap.end())
		{
			numMap.insert(pair<int, int>(num, 1));
		}
		else
		{
			found->second++;
		}
	}

	int M;
	cin >> M;
	for (int i = 0; i < M; i++)
	{
		int num;
		cin >> num;
		auto found = numMap.find(num);
		if (found == numMap.end())
		{
			cout << "0\n";
		}
		else 
		{
			cout << found->second << "\n";
		}
	}

	return 0;
}