PAT : 数据结构与算法题目集（中文）7-9 旅游规划

#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int INF = 0x3F3F3F3F;
struct ints
{
    int Aim, length, cost;
};
int getdigit(void)
{
    int temp{0};
    char ch;
    while (1)
    {
        ch = getchar();
        if (ch == ' ' || ch == '\n' || ch == '\n')
            return temp;
        temp = temp * 10 + ch - '0';
    }
}
void putdigit(int temp)
{
    if (temp >= 10)
        putdigit(temp / 10);
    putchar('0' + (temp % 10));
}
void Dijkstra(vector<vector<ints>> Graph, int A, int B)
{
    vector<int> dist(Graph.size(), INF);
    vector<int> cost(Graph.size());
    vector<bool> book(Graph.size());
    dist[A] = 0;
    while (1)
    {
        int Index{-1}, Min{INF};
        int Size = dist.size();
        for (int i = 0; i !=