The problem of the ship of greedy algorithm

There are n individuals, the personal weight of w[i], the maximum load per ship is C, and can only be up to two people. Load the owner with the fewest ships.

Idea: From the lightest start, let the lightest and heaviest boat, if it exceeds the weight, can be judged to be the heaviest of a ship.

Code:

#include <iostream>#include<algorithm>using namespacestd;intn,m;inta[ -];intMain () {CIN>>n>>m;//N is the number of people, M is the maximum load of a ship     for(intI=1; i<=n;i++) cin>>A[i]; Sort (a+1, a+n+1); intI=1, j=N; intans=0;  while(i<j) {if(a[i]+a[j]>m) j--; Else{i++; J--; Ans++; }} cout<<ans+n-2*ans<<Endl; return 0;}

The problem of the ship of greedy algorithm