For this Question: During the elections, Bob is in charge of conducting voting in his village, but the EVM system malfunctioned, and there was a long line of voters waiting outside to vote. The following is how the Advanced EVM Machine works.
Each time when a voter scans his VoterId Card and votes for the party of his choice, the Voter's id and Party Name are registered in the background, and if the same voter votes again, the EVM does not capture his vote, then the vote is skipped and the vote given the first time is used.
Now that you are Bob's best mate, you can't bear to see him in such a strained situation when outside voters are being very aggressive and screaming at him. Can you easily write a piece of code to save your friend's life while Bob is busy calming down the outside situation?The number N (1 ≤ N ≤ 1e5) appears on the first line. The queries to the machine are included in the next n lines. Each request consists of two strings and is written on a non-empty line. The first string is a Voter Card Id, and the second string is the Party Name, all of which are at most 32 characters long both upper case and lower case possible.

<b>Constraints</b>
1 ≤ N ≤ 100000
1 ≤ Voter Id length ≤ 40
1 ≤ PartyName length ≤ 32Output a single line indicating which party has won and by how many votes. In case of a draw between parties print all the parties with the same winning vote, in lexographically increasing order on basis of Party Name.Sample Input 
4
12678345 BJP
57891082 congress
12678345 AAP
65489 TMC

Sample Output 
BJP 1
Congress 1
TMC 1

<b>Explanation :</b>
As Winning Parties here as BJP, Congress, TMC with 1 vote(s) each, but AAP vote is not considered because the same VoterId - 12678345 has done a vote again., I have written this Solution Code: /**
 *    author:  tourist1256  
 *    created: 2021-4-2 13:58:11 
**/

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>

using namespace std;

double pi = acos(-1);
#define tezi                          \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);
#define F_OR(i, a, b, s) \
    for (ll i = (a); (s) > 0 ? i < (b) : i >= (b); i += (s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...)       \
    F_ORC(__VA_ARGS__) \
    (__VA_ARGS__)
#define EACH(x, a) for (auto &x : a)
#define itr(it, a) for (auto it = a.begin(); it != a.end(); it++)

#define fill(a, b) memset(a, b, sizeof(a))
#define LOCAL
#define time cout << (0.1 * clock()) / CLOCKS_PER_SEC << endl;
#define countBits(x) __builtin_popcount(ll(x))
#define countZeroesAtBegin(x) __builtin_clz(ll(x))
#define countZeroesAtEnd(x) __builtin_ctz(ll(x))
#define last(x) x[x.end() - x.begin() - 1]
#define pb push_back
#define bg begin
#define ff first
#define ss second
#define pi 3.1415926535897932384626
#define infll 0x3f3f3f3f3f3f3f3f
using ll = long long;
using pl = pair<ll, ll>;
using vll = vector<ll>;
using vpl = vector<pl>;
using mat = vector<vll>;
const ll MAX = 1e5;
const ll mod = 1e9 + 7;
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
static int row[4] = {-1, 0, 0, 1};
static int col[4] = {0, -1, 1, 0};

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    EACH(ele, v) { cout << ele << " "; }
    return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    return os << '(' << p.ff << "," << p.ss << ')';
}

template <typename T>
istream &operator>>(istream &in, vector<T> &v) {
    EACH(ele, v) { cin >> ele; }
    return in;
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

void _runtime_terror_() {
    ll N, winningVotes = -infll;
    cin >> N;
    string voterId, partyName;
    map<string, ll> database;
    map<string, bool> voters;
    for (int i = 0; i < N; i++) {
        cin >> voterId >> partyName;
        if (voters.find(voterId) == voters.end()) {
            voters[voterId] = true;
            database[partyName] += 1;
            winningVotes = max(database[partyName], winningVotes);
        }
    }
    vector<pair<string, ll>> ans;
    for (auto &it : database) {
        if (winningVotes == it.ss) {
            ans.pb({it.ff, it.ss});
        }
    }
    for (auto &it : ans) {
        cout << it.ff << " " << it.ss << "\n";
    }
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("debug.txt", "w", stderr);
#endif
    tezi;
    int tc = 1;
    // cin >> tc;
    while (tc--) {
        _runtime_terror_();
    }
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?