백준 11557번: Yangjojang of The Year

https://www.acmicpc.net/problem/11557

1. 문제

2. 알고리즘

키워드 - 구현, 배열

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    
    int t; cin >> t;
 
    while(t--) {
        
        int n; cin >> n;
        cin.ignore();
        map<string, int> m;
        for (int i=0; i<n; i++) {
            string name;
            int cnt;
            cin >> name >> cnt;
            m[name] = cnt;
        }
        
        string sol; int cand = 0;
        map<string, int>::iterator it;
 
        for(it = m.begin(); it != m.end(); it++) {
            if (cand < it->second) {
                cand = it->second;
                sol.clear();
                sol = it->first;
            }
        }
 
        cout << sol << CENDL;
        m.clear();
    }
 
    return 0; 
}