Kampanja Debug

#include <bits/stdc++.h>

using namespace std;

bool sorting(pair<int, int> a, pair<int, int> b) {
    if (a.first == b.first) {
        if (a.second > b.second) return true;
        else return false;
    } else if (a.first < b.first)
        return true;
    return false;
}

int main()
{
    int n, c;
    cin >> n >> c;

    vector<  pair<int, int>  > diff;
    for (int i = 0; i < c; ++i) {
        int p, r;
        cin >> p >> r;

        diff.push_back(make_pair(p - r, p));
    }

    sort(diff.begin(), diff.end(), sorting);

    int COUNT = 0;
    int i = 0;

    vector<bool> takens(c, false);

    for (i = 0; i < diff.size(); ++i) {

        // IF THE YOU CAN GO TO THAT CITY, GO THERE :D
        if (n - diff[i].second >= 0) {
            n -= diff[i].first;

            cout << "i: " << i << " => " << diff[i].first << ", " << diff[i].second << endl;
            cout << "Taken " << diff[i].first << endl;
            cout << "Current N: " << n << endl;
            takens[i] = true;

            COUNT++;
        }
    }

    cout << "N left : " << n << endl;

    cout << "Next city : " << "i+1: " << i << " => " << diff[i].first << ", " << diff[i].second << endl;
    cout << "Next city : " << "i+2: " << i+1 << " => " << diff[i+1].first << ", " << diff[i+1].second << endl;
    cout << "Next city : " << "i+3: " << i+2 << " => " << diff[i+2].first << ", " << diff[i+2].second << endl;

    for (int t = 0; t < takens.size(); ++t) {
        if (!takens[t]) {
            cout << "not taken => t : " << t << ", costs : " << diff[t].second << endl;
        }
    }

    cout << COUNT << endl;

    return 0;
}