Depend Truthful pairs in a String with Uppercase-Lowercase operations

#embrace <bits/stdc++.h>

utilizing namespace std;

void countPairs(string S, int n, int K)

{

    map<char, lengthy lengthy int> mp;

    for (lengthy lengthy int i = 0; i < n; i++) {

        mp[S[i]]++;

    }

    char xxx = 'a';

    char yyy = 'A';

    lengthy lengthy int output = 0;

    for (lengthy lengthy int i = 0; i < 26; i++) {

        lengthy lengthy int l = mp[xxx];

        lengthy lengthy int u = mp[yyy];

        whereas (l > 0 && u > 0) {

            output++;

            l--;

            u--;

        }

        whereas (K > 0 && u > 1) {

            K--;

            output++;

            u -= 2;

        }

        whereas (K > 0 && l > 1) {

            K--;

            output++;

            l -= 2;

        }

        xxx++;

        yyy++;

    }

    cout << output << endl;

}

int foremost()

{

    lengthy lengthy int N, K = 2;

    string S = "xyyXzzYyxxZ";

    N = S.size();

    countPairs(S, N, K);

    return 0;

}