PAT 练习二 去罗马的快乐 [1002]

不知错在哪,我尽力了……完全仿照第一题来着，我再去看大神代码吧

 

#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<climits>
using namespace std;
void dfs(int start,int index,int end);
int cnum,rnum;
//struct point{
  //  string cityname;
    //int happiness;
    //bool visited;
//} 
//string staC;
vector <string> city;
map <string,int> index;
vector <int> happiness;
vector <vector<int>> cost;
vector <bool> visited;
vector <string> path;
vector <string> resPath;
int pathNum=0,costTs=0,happ=0;
int resHapp=0;
int avHapp=0;
int resCost=INT_MAX;

int main(){
    ios::sync_with_stdio(false);
    cin>>cnum>>rnum;
    city.resize(cnum);
    happiness.resize(cnum,0);