7-131 4101 统计字符数

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;

void solve();

int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    solve();
}

void solve()
{

    i32 t;
    std::cin >> t;
    bool endl = false;
    while (--t >= 0)
    {
        if (endl)
        {
            std::cout << '\n';
        }
        std::unordered_map<char, i32> map;
        std::string str;
        std::cin >> str;
        for (auto &item : str)
        {
            ++map[item];
        }
        char answer{0};
        i32 max = -1;
        for (auto &[k, v] : map)
        {
            if (v >= max)
            {
                max = v;
                answer = k;
            }
        }
        std::cout << answer << ' ' << map[answer];
        endl = true;
    }
}