Baekjoon #19637

Baekjoon #19637

1개의 풀이 · C++

문제 원문 보기 ↗

SOLUTION INFO

C++ · main.cpp

main.cpp
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M;
    cin >> N >> M;

    vector<int> title_levels;
    vector<string> title_names;

    title_levels.reserve(N);
    title_names.reserve(N);

    for(int i = 0; i < N; i++) {
        string name;
        int level;
        cin >> name >> level;

        if (!title_levels.empty() && title_levels.back() == level) {
            continue;
        }

        title_levels.push_back(level);
        title_names.push_back(name);
    }

    for(int i = 0; i < M; i++) {
        int power_level;
        cin >> power_level;

        int index = lower_bound(title_levels.begin(), title_levels.end(), power_level) - title_levels.begin();
        cout << title_names[index] << '\n';
    }

    return 0;
}

SOLUTION DESCRIPTION

풀이 설명

등록된 풀이 설명이 없습니다.