Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <cmath> #include <vector> #include <queue> #include <algorithm> #include <cstring> #include <fstream> using namespace std; vector<pair<int, int> > graph[105]; int main() { int n ,m; cin >> n >> m; for(int i =0; i < m; i++) { int a, b, c; cin >> a >> b >> c; graph[a].push_back(make_pair(c, b)); graph[b].push_back(make_pair(c, a)); } for(int i =0 ;i < n; i++) { sort(graph[i].begin(), graph[i].end()); } return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
