yy

#include "stdafx.h"
#include "iostream"


using namespace std;


int LeastBox(int V, int N, int * objects)
{
if (N < 1)
{
return 0;
}
if (N < 2)
{
return 1;
}
int box = 0;


// 插入排序
if (objects[0] < objects[1])
{
int tmp = objects[1];
objects[1] = objects[0];
objects[0] = tmp;
}
for (int i = 2; i < N; i++)
{
for (int j = i; j > 0; j--)
{
if (objects[j] > objects[j - 1])
{
int tmp = objects[j];
objects[j] = objects[j - 1];
objects[j - 1] = tmp;
}
else
{
break;
}
}
}




// 最大者加上最小者
int i = 0;
int j = N - 1;
while (i < j)
{
if (objects[i] + objects[j] <= V)
{
i++;
j--;
box++;
continue;
}
else
{
i++;
box++;
continue;
}
}
return box;
}


int _tmain(int argc, _TCHAR* argv[])
{
int V = 0;
int N = 0;
int * objects = NULL;
cout << "盒子容积：";
cin >> V;
cout << "物品数：";
cin >> N;
objects = new int[N];
cout << "详细物品体积：";
for (int i = 0; i < N; i++)
{
cin >> objects[i];
}
cout << "最少的盒子数目为：" << LeastBox(V, N, objects) << endl;
delete [] objects;
system("pause");
return 0;

}