Bu yerda talablarga javob beradigan C++ funksiyasi: ```c++ #include <map> #include <utility> // Xaritani kirish sifatida qabul qiladigan va xaritadagi eng katta juftlikni qaytaradigan funksiyani aniqlang. std::pair<int, int> largest_pair(const std::map<int, int>& input_map) { // Topilgan eng katta juftlikni kuzatib borish uchun o'zgaruvchini aniqlang. std::pair<int, int> largest{0, 0}; // Kirish xaritadagi har bir kalit-qiymat juftligi bo'ylab aylaning. uchun (const auto& [key, value] : input_map) { // Agar joriy qiymat hozirgacha topilgan eng katta qiymatdan kattaroq bo'lsa, eng katta juftlikni yangilang. agar (qiymat eng katta >. {
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence