/**
1601 · Boats to Save People
Algorithms
Medium
Accepted Rate
61%
DescriptionSolutionNotesDiscussLeaderboard
Description
The i-th person has weight people[i], and each boat can carry a maximum weight of limit.
Each boat carries at most 2 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. (It is guaranteed each person can be carried by a boat.)
1 \leq people.length \leq 500001≤people.length≤50000
1 \leq people[i] \leq limit \leq 300001≤people[i]≤limit≤30000
Example
Example 1:
Input: people = [1,2], limit = 3
Output: 1
Explanation: 1 boat (1, 2)
Example 2:
Input: people = [3,2,2,1], limit = 3
Output: 3
Explanation: 3 boats (1, 2), (2) and (3)
Example 3:
Input: people = [3,5,3,4], limit = 5
Output: 4
Explanation: 4 boats (3), (3), (4), (5)
https://blog.csdn.net/qq_46105170/article/details/110676225
https://www.lintcode.com/problem/1601/
*/
import "sort"
/**
* @param people: The i-th person has weight people[i].
* @param limit: Each boat can carry a maximum weight of limit.
* @return: Return the minimum number of boats to carry every given person.
*/
func numRescueBoats (people []int, limit int) int {
// Write your code here.
sort.Ints(people)
var res, i int = 0, 0
var j int = len(people) - 1
for {
if i >= j {
break
}
if people[i] + people[j] <= limit {
i += 1
}
j -= 1
res += 1
}
if i == j {
res += 1
}
return res
}