function solution(people, limit) {
let count = 0;
people.sort((a,b) => a-b)
let left = 0
let right = people.length-1;
while(left <= right) {
const sum = left < right ? people[left] + people[right] : people[right]
if(sum > limit) {
right--;
} else {
left++;
right--;
}
count++;
}
return count;
}