由小到大的排序
void sort1(vector<double> area, vector<int> num, int &a)
{
int i = 0, j = 0;double temp = 0;
double temp_num = 0;
for (int i = 0;i < area.size() - 1;i++)
{
for (j = 0;j < area.size() -1- i;j++)
{
if (area[j] >area[j + 1])
{
temp = area[j];
area[j] = area[j + 1];
area[j + 1] = temp;
temp_num = num[j];
num[j] = num[j + 1];
num[j + 1] = temp_num;
}
}
}
a = num[area.size() - 2];
}