RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
R03571

J2. Silent Auction

Unrated 레이팅 미적용
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

A charity is having a silent auction where people place bids on a prize without knowing anyone else’s bid. Each bid includes a person’s name and
the amount of their bid. After the silent auction is over, the winner is
the person who has placed the highest bid. If there is a tie, the person
whose bid was placed first wins. Your job is to determine the winner of the silent auction.

제약

\(1 \leq N \leq 100\)

입력 형식

The first line of input contains a positive integer \(N\), where \(1 \leq N \leq 100\), representing the number of bids collected at
the silent auction. Each of the next \(N\) pairs of lines contains a person’s name
on one line, and the amount of their bid, in dollars, on the next line.
Each bid is a positive integer less than \(2000\). The order of the input is the order
in which bids were placed.

출력 형식

Output the name of the person who has won the silent auction.

예제 1
입력
3
Ahmed
300
Suzanne
500
Ivona
450
출력
Suzanne
설명

The highest bid placed was 500 and it was placed by Suzanne. Suzanne wins the silent auction.

예제 2
입력
2
Ijeoma
20
Goor
20
출력
Ijeoma
설명

The highest bid placed was 20 and it was placed by both Ijeoma and Goor. Since Ijeoma’s bid was placed first, Ijeoma wins the silent auction.

문제 정보

생성자가 기록되지 않았습니다.

출처 CCC 2021 Junior

평가 및 의견

J2. Silent Auction

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

J2. Silent Auction

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8