Submission #19025550

---

Source Code Expand

#include <iostream>
#include <vector>
#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];
	std::sort(a.begin(), a.end());
	for(int i = 0; i < m; i++) std::cin >> b[i];
	std::sort(b.begin(), b.end());
	int i = 0, j = 0, prev = -1;
	while(i < n && j < m){
		if(a[i] == b[j] && a[i] != prev){
			std::cout << a[i] << "\n";
			prev = a[i];
		}
		if(a[i] < b[j]) i++;
		else j++;
	}
	return 0;
}

Submission Info

Judge Result