贪心入门——独木舟

/**
    独木舟问题 
    将人的体重降序排序
    最重的和最轻的人一起坐(i++,j--)
    否则 重的人单独坐一条船
**/

#include <iostream>
using namespace   std;

void Sort(long long a[],long n);
int ShipNum(long long a[],long n,long long shipweight);

long long weight[10000]={0};

int main()
{
    int num = 0;
    long long shipweight=0;
    cin>>num>>shipweight;

    int i=0;
    for(i=0;i<num;i++)
    {
        cin>>weight[i];
    }
    Sort(weight,num);
   cout<<ShipNum(weight,num,shipweight<<endl;
return 0;

}

void Sort(long long a[],long n)
{
    int i = 0,j = 0;
    long long temp = 0;
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(a[i] < a[j])
            {
                temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }
}

int ShipNum(long long a[],long n,long long shipweight)
{
    long i=0,j=n-1;
    int shipnum = 0;
    while(i <= j)
    {
        if((a[i]+a[j]) <= shipweight)
        {
            shipnum++;
            i++;
            j--;
        }
        else
        {
            shipnum++;
            i++;
        }
    }
    return shipnum;
}