28490번 - Area 서브태스크다국어
| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 1429 | 1249 | 1199 | 88.162% |
문제
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 ≤ n ≤ 100$
- $1 ≤ h[i], w[i] ≤ 1000$
서브태스크
| 번호 | 배점 | 제한 |
|---|---|---|
| 1 | 50 | $n = 1$ |
| 2 | 50 | No additional restrictions |
예제 입력 1
3 5 9 19 4 8 10
예제 출력 1
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$.
예제 입력 2
5 8 2 4 9 3 8 1 7 9 4
예제 출력 2
36
출처
Olympiad > National Olympiad in Informatics (Singapore) > Qualification > NOI 2023 Qualification 1번
채점 및 기타 정보
- 예제는 채점하지 않는다.