小白书贪心之乘船问题

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string>
#include<set>
#include<map>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e6+10;
const double eps=1e-5;
int w[maxn];
int n,c;
int main()
{
cin>>n>>c;
for(int i=0;i<n;i++)
scanf("%d",&w[i]);
sort(w,w+n);
int l=0,r=n-1;
int sum=0;
while(l<r){
if(w[l]+w[r]<c){
l++;r--;
sum++;
}
else{
r--;
sum++;
}
}
cout<<sum<<endl;
}