How would I write this python code in c++

Question

I'm doing a leetcode problem about squares intersecting. Here's how I was able to figure it out in Python, but how would I write it in C++?

def intersections(rects):
    events = []
    for A in rects:
        events.append((A.x, 'insert', A.y, A.Y))
        events.append((A.X, 'remove', A.y, A.Y))
    intersections = 0
    ys = SortedList()
    Ys = SortedList()
    for x, op, y, Y in sorted(events):
        if op == 'insert':
            intersections += ys.bisect_right(Y) - Ys.bisect_left(y)
            ys.add(y)
            Ys.add(Y)
        else:
            ys.remove(y)
            Ys.remove(Y)
    return intersections

Answer 1

I haven't touched C++ in some time... So this is merely an attempt to start with.

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

using namespace std;

struct Rect {
    int x, X, y, Y;
};

int intersections(vector<Rect> &rects) {
    vector<pair<int, pair<char, pair<int, int>>>> events;
    for (auto &A : rects) {
        events.emplace_back(A.x, make_pair('i', make_pair(A.y, A.Y)));
        events.emplace_back(A.X, make_pair('r', make_pair(A.y, A.Y)));
    }
    sort(events.begin(), events.end());
    int intersections = 0, n = events.size();
    vector<int> ys, Ys;
    for (int i = 0; i < n; i++) {
        int x = events[i].first, y = events[i].second.second.first, Y = events[i].second.second.second;
        if (events[i].second.first == 'i') {
            intersections += upper_bound(ys.begin(), ys.end(), Y) - lower_bound(ys.begin(), ys.end(), y);
            ys.push_back(y);
            Ys.push_back(Y);
        } else {
            ys.erase(lower_bound(ys.begin(), ys.end(), y));
            Ys.erase(lower_bound(Ys.begin(), Ys.end(), Y));
        }
    }
    return intersections;
}

int main()