1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T4f6,#include #include #include #include #include #include #include #define ll long long #define sz(x) ((int)(x).size()) #define rep(i, n) for(int i=0; i<(n); i++) #define set0(arr) memset(arr, 0, sizeof(arr)) #define MOD 1000000007 using namespace std; struct customCompare { bool operator() (const pair &lhs, const pair &rhs) const { return lhs.second > rhs.second; } }; int main() { ios::sync_with_stdio(false);cin.tie(NULL); int V, E, u, v, w; cin >> V >> E; vector>> adj(V); vector selected(V); priority_queue, vector>, customCompare> que; // destination of path, weight of path ll ans = 0; rep(i, E) { cin >> u >> v >> w; u--; v--; adj[u].emplace_back(v, w); adj[v].emplace_back(u, w); } selected[0] = true; for(auto pr: adj[0]) { que.push(pr); } while(!que.empty()) { auto pr = que.top(); que.pop(); if(!selected[pr.first]) { ans += (ll)pr.second; //printf("pr.first=%d, pr.second=%d. ans is now %d\n", pr.first, pr.second, ans); selected[pr.first] = true; for(auto nextpr: adj[pr.first]) { if(!selected[nextpr.first]) que.push(nextpr); } } } cout << ans; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":"page.tsx","children":[["$","div",null,{"className":"w-full","children":

코드 #2886