| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 1362 | 1194 | 1144 | 88.545% |
Stuart has $n$ rectangular frames, which are numbered from 1ドル$ to $n$. Frame $i$ is a rectangle with height $h[i]$ and width $w[i]$.
The size of a frame is the area that it covers. Stuart wants you to help him find the area covered by the largest size frame that he has.
The first line of input contains exactly 1ドル$ integer, $n$.
The next $n$ lines of input contains two space-separated integers each. The $i$-th such line of input will contain $h[i]$ and $w[i]$ respectively, representing the height and width of frame $i$.
The output should contain one integer, the area covered by the largest size frame Stuart has.
| 번호 | 배점 | 제한 |
|---|---|---|
| 1 | 50 | $n = 1$ |
| 2 | 50 | No additional restrictions |
3 5 9 19 4 8 10
80
The size of frame 1ドル$ is $h[1] \times w[1] = 5 \times 9 = 45$.
The size of frame 2ドル$ is $h[2] \times w[2] = 19 \times 4 = 76$.
The size of frame 3ドル$ is $h[3] \times w[3] = 8 \times 10 = 80$.
Among the above frames, the largest size is 80ドル$.
5 8 2 4 9 3 8 1 7 9 4
36
Olympiad > National Olympiad in Informatics (Singapore) > Qualification > NOI 2023 Qualification 1번