우선순위큐 다익스트라

#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX= 21e5;
int result[5];
struct Node {
	int n;
	int price;
};
vector<vector<Node>>alist(5);
bool operator<(Node v, Node t) {
	return t.price<v.price;
}
priority_queue<Node>q;
void input() {
	for (int i = 0; i < 5; i++) {
		result[i] = MAX;
	}
	q.push({ 0,0 });
}
int main() {
	
	input();

	
	return 0;
}