Submission #19024600

---

Source Code Expand

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

int main() {
	int n,m;
	std::cin >> n >> m;
	std::vector<int> a(n),b(m);
	std::vector<std::pair<int,char>> ret;
	for(int i = 0; i < n; i++){
		std::cin >> a[i];
		ret.push_back({a[i],'A'});
	}
	for(int i = 0; i < m; i++){
		std::cin >> b[i];
		ret.push_back({b[i],'B'});
	}
	std::sort(ret.begin(), ret.end());
	for(int i = 1; i < m+n; i++){
		if(ret[i-1].first == ret[i].first && ret[i-1].second != ret[i].second)
			std::cout << ret[i].first << "\n";
	}
	return 0;
}

Submission Info

Judge Result