BOJ 21613 - Silent Auction [C++]

문제

링크

풀이

#include <iostream>
#include <string>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
 
  string a = ""; int b = 0;
  while (n--) {
    string s; cin >> s;
    int x; cin >> x;
    if (x > b) a = s, b = x;
  }
  cout << a;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}