7-81 1020 最高分和最低分

#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#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();
}

struct student_info
{
    std::string name;
    i32 score;
};

void print(const std::string obj, i32 value, const std::vector<student_info> infos)
{
    std::cout << obj << " is " << value << ",name ";
    if (infos.size() > 1)
    {
        std::cout << "have";
    }
    else
    {
        std::cout << "has";
    }
    std::cout << " ";
    bool need_break = false;
    for (const auto &item : infos)
    {
        if (need_break)
        {
            std::cout << ',';
        }
        std::cout << item.name;
        need_break = true;
    }
}

void solve()
{
    std::string name;
    i32 score;
    i32 max = std::numeric_limits<i32>::min(), min = std::numeric_limits<i32>::max();
    std::vector<student_info> infos;
    while (std::cin >> name >> score)
    {
        max = std::max(score, max);
        min = std::min(score, min);
        student_info info{name, score};
        infos.emplace_back(std::move(info));
    }
    std::vector<student_info> min_infos, max_infos;
    for (const auto &item : infos)
    {
        if (item.score == min)
        {
            min_infos.emplace_back(item);
        }
        if (item.score == max)
        {
            max_infos.emplace_back(item);
        }
    }
    print("Max", max, max_infos);
    std::cout << std::endl;
    print("Min", min, min_infos);
}

好恶心的格式题