In general, both STL set and map has O(log(N)) complexity for insert, delete, search etc operations. But in some problems, set gives TLE, while map gets AC. Can someone please explain how map gives a better runtime than set? Thanks in advance :)