You are given an array people where`people[i]` is the weight of the i^th person, and an**infinite number of boats** where each boat can carry a maximum weight of`limit`. Each boat carries at most two people at the same time, provided the sum of the weight of those people is at most`limit`.

Return the minimum number of boats to carry every given person.

**Example 1:**

**Example 2:**

Boats to Save People

**Example 3:**

package Solution

funcSolution(xbool)bool {

funcSolution(people []int,limitint)int {

sort.Ints(people)

left,right:=0,len(people)-1

forleft<=right {

ifpeople[left]+people[right]<=limit {

}

}

}

cases:= []struct {

people []int

}{

{"TestCase",true,true},

{"TestCase",true,true},

{"TestCase",false,false},

{"TestCase1", []int{1,2},3,1},

{"TestCase2", []int{3,2,2,1},3,3},

}

fori,c:=rangecases {

t.Run(c.name+" "+strconv.Itoa(i),func(t*testing.T) {

got:=Solution(c.inputs)

got:=Solution(c.people,c.limit)

if!reflect.DeepEqual(got,c.expect) {

t.Fatalf("expected: %v, but got: %v, with inputs: %v",

c.expect,got,c.inputs)

t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",

c.expect,got,c.people,c.limit)

}

})

}

}

funcBenchmarkSolution(b*testing.B) {

}

funcExampleSolution() {

}