婚姻匹配算法

/*Copyright (c)2018, 东北大学软件学院学生          
* All rightsreserved          
* 文件名称：a.cpp          
* 作   者：孔云         
*问题描述：参考注释*/
#include <iostream>
#include <cstdlib>
using namespace std;
bool finish_or_not(int, int *);
bool current_male_is_better(int num, int *male_rank_in_female, int current, int chasing);
int main(){
   int num = 5;
   int female_rank_in_male[5][5] = { { 2, 1, 4, 5, 3 }, { 4, 2, 1, 3, 5 }, { 2, 5, 3, 4, 1 }, { 1, 4, 3, 2, 5 }, { 2, 4, 1, 5, 3 } };
   int male_rank_in_female[5][5] = { { 5, 1, 2, 4, 3 }, { 3, 2, 4, 1, 5 }, { 2, 3, 4, 5, 1 }, { 1, 5, 4, 3, 2 }, { 4, 2, 5, 3, 1 } };

   for (int i = 0; i < num; i++){
       cout << "男生 " << i << " 心目中妹子的排行：";
       for (int j = 0; j < num; j++){
           cout << female_rank_in_male[i][j] << " ";
       }
       cout << endl;
   }
   cout << endl;
   for (int i = 0; i < num; i++){
       cout << "女生 " << i << " 心目中男生的排行：";
       for (int j = 0; j < num; j++){
           cout << male_rank_in_female[i][j] << " ";
       }
       cout << endl;
   }

   //男生和妹子正在约会的对象
   int *date_of_male = new int[num];
   int *date_of_female = new int[num];
   for (int i = 0; i < num; i++){
       date_of_male[i] = 0;
       date_of_female[i] = 0;
   }

   //男生追求过的妹子的数量
   int *num_of_chased_female = new int[num];
   for (int i = 0; i < n