7-132 4102 气球升起来

#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()
{
    bool endl = false;
    while (true)
    {
        i32 n;
        std::cin >> n;
        if (n == 0)
        {
            return;
        }
        if (endl)
        {
            std::cout << '\n';
        }
        std::unordered_map<std::string, int> map;
        for (i32 i = 1; i <= n; ++i)
        {
            std::string str;
            std::cin >> str;
            ++map[str];
        }
        std::string answer;
        i32 max{-1};
        for (const auto &[k, v] : map)
        {
            if (v > max)
            {
                max = v;
                answer = k;
            }
        }
        std::cout << answer;
        endl = true;
    }
}