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.)
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)
Note:
1 <= people.length <= 50000
1 <= people[i] <= limit <= 30000
python
class Solution:
def numRescueBoats(self, people: List[int], limit: int) -> int:
people.sort()
i,j=0,len(people)-1
nums=0
while(i<=j):
if(people[i]+people[j]<=limit):
i+=1
j-=1
nums+=1
return nums
c++
class Solution {
public:
int numRescueBoats(vector<int>& people, int limit) {
sort(people.begin(),people.end());
int i=0;
int j=people.size()-1;
int nums=0;
while(i<=j){
if (people[i]+people[j]<=limit)
i+=1;
j--;
nums+=1;
}
return nums;
}
};
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int main(){
int numbers;
cin>>numbers;
int limit;
cin>>limit;
int weight[50000];
for(int i=0;i<numbers;i++)
cin>>weight[i];
int i=0;
int j=numbers-1;
sort(weight,weight+numbers);
int res=0;
while(i<=j){
if (weight[i]+weight[j]<=limit)
i+=1;
j-=1;
res+=1;
}
cout<<res<<endl;
return 0;
}