1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
| using System;
public class Solution
{
public int solution(int[,] sizes)
{
//Bigger Side Sort To Left
for(int i = 0; i<sizes.GetLength(0);i++)
{
if(sizes[i,0] < sizes[i,1])
{
int tmp = 0;
tmp = sizes[i,0];
sizes[i,0] = sizes[i,1];
sizes[i,1] = tmp;
}
}
int maxX = 0;
for(int i = 0; i<sizes.GetLength(0);i++)
{
if(sizes[i,0] > maxX)
{
maxX = sizes[i,0];
}
}
int maxY = 0;
for(int i = 0; i<sizes.GetLength(0);i++)
{
if(sizes[i,1] > maxY)
{
maxY = sizes[i,1];
}
}
return maxX*maxY;
}
}
|