Hello everyone
I was solving this problem on Leetcode (easy one), first I submitted my code with a comparator function to sort 2D vector using cmps() i.e. comparator function submission with comparator and then I submitted again without using comparator function as bydefault sort() sorted 2D vector based on first element of each vector element submission without comparator,on submission there's a huge gap in time taken as well as memory taken.
Can anyone help me/inform me how time/memory complexity changes with custom Comparator function.
By the way maximum size of vector element in 2D vector is 2 so more like vector of pair.
I think your comparator is taking the vector (or the pair) arguments by value, so it's a lot more copies.