Efficient data structure for Intersection C++

Q1. What would be the time complexity to find intersection of two SORTED ranges or arrays? Which data structure or STL container would give the best time complexity?

Q2. Does O(n² * log(c)) pass in 2 seconds time limit? n = 10^5