C++ 搬水果贪心算法实现代码

#include <iostream> 
#include <vector> 
 
using namespace std; 
/* 
* 得到队列中的最小元素 
*/ 
int Extract_MIN(vector<int>& v) 
{ 
  if(v.size() == 0) 
    return -1; 
  int i=0, min_pos = 0; 
  vector<int>::iterator iter = v.begin(); 
  vector<int>::iterator min_iter = v.begin(); 
  for(; iter!=v.end(); ++iter) 
    if((*iter)<(*min_iter)) 
      min_iter = iter; 
  int min_value = *(min_iter); 
  v.erase(min_iter); 
  return min_value; 
} 
/* 
*计算过程，类似于构建哈夫曼树 
*/ 
int MoveFruit(int data[], int n) 
{ 
  //将元素初始化到队列中 
  vector<int> v; 
  int i=0; 
  for(i=0; i<n; ++i) 
    v.push_back(data[i]); 
  int total = 0;//总体力消耗值 
  //依次组合 
  int left = 0, right=0, parent=0;//每次合并一堆，选取队列中最小的两个数作为左孩子和右孩子 
  for(i=1; i<n; ++i) 
  { 
     left = Extract_MIN(v); 
     right = Extract_MIN(v); 
     parent = left+right; 
    total += parent; 
    v.push_back(parent); 
  } 
  return total; 
} 
 
int main() 
{ 
  int n; 
  while(cin>>n) 
  { 
    if(n == 0) 
      break; 
    int* data = new int[n]; 
     
    int i=0; 
    for(; i<n; ++i) 
      cin>>data[i]; 
    cout<<MoveFruit(data, n)<<endl; 
        delete[] data; 
    } 
   
}