There are N rectangular buildings standing along the road next to each other. The K-th building is of size H[K] × 1. Because a renovation of all of the buildings is planned, we want to cover them with rectangular banners until the renovations are finished. Of course, to cover a building, the banner has to be at least as high as the building. We can cover more than one building with a banner if it is wider than 1. We can order at most two banners and we want to cover all of the buildings. Also, we want to minimize the amount of material needed to produce the banners. What is the minimum total area of at most two banners which cover all of the buildings? Write a function: class Solution { public int solution(int[] H); } that, given an array H consisting of N integers, returns the minimum total area of at most two banners that we will have to order.