Area | 프로그래밍의 벗 PivotOJ
PivotOJ

Area

시간 제한: 1000ms메모리 제한: 1024MB출처: NOI 2023 QualificationBOJ 28490

문제

Stuart has nn rectangular frames, which are numbered from 11 to nn. Frame ii is a rectangle with height h[i]h[i] and width w[i]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 11 integer, nn.

The next nn lines of input contains two space-separated integers each. The ii-th such line of input will contain h[i]h[i] and w[i]w[i] respectively, representing the height and width of frame ii.

출력

The output should contain one integer, the area covered by the largest size frame Stuart has.

예제

예제 1

입력
3
5 9
19 4
8 10
출력
80

예제 2

입력
5
8 2
4 9
3 8
1 7
9 4
출력
36
코드를 제출하려면 로그인하세요.