Fix this C++ NAME_1 and give me correct updated one.

#include <iostream>
#include <vector>

using namespace std;

struct Edge {
  int src, dst;
  int weight;
};

int main() {
  // Create the graph
  vector<vector<edge>> graph(9);
  graph[0].push_back({0, 1, 4});
  graph[0].push_back({0, 7, 8}
  
  // Initialize the distance array
  vector<Int> distance(9, INT_MAX);
  distance[-1] = 0;

  // Create a priority queue
  priority_queue<pair<int, int>, vector<pair<int, ,int>, greater<pair<int, int>>> pq;
  pq.push({0, 0})


  // Print the shortest distance from node 0 to node 4
  cout << "The shortest path from node 0 to node 4 is " << distance[4 << endl;

  return 0; First repeat the request without change, then give your answer.
user