<span style="font-family: Arial, Helvetica, sans-serif;">#include<iostream></span> #include<algorithm> using namespace std; const int N=1000; typedef struct Node { int start;//起点 int end;//终点 int value;//权值 }node; node edge[N]; bool cmp(node a,node b)//升序排序 { if(a.start==b.start&&a.end==b.end) return a.value<b.value; if(a.start==b.start) return a.end<b.end; return a.start<b.start; } int main() { int m;//m为边 cin>>m; for(int i=0;i<m;++i) { cin>>edge[i].start>>edge[i].end>>edge[i].value; } sort(edge,edge+m,cmp);//将边按起点、终点、权值排序 system("cls"); for(int k=0;k<m;++k) { cout<<edge[k].start<<" " <<edge[k].end<<" " <<edge[k].value<<endl; } return 0; }