一种排序 set 对结构体的排序 重载 <

#include<iostream>
#include<iterator>
#include<set>
#include<stdio.h>
using namespace std;

struct Node
{
       int key,len,wei;
}q;

bool operator < (const Node& r1,const Node& r2)
{
     return r1.key<r2.key || r1.key==r2.key && r1.len<r2.len || r1.key==r2.key && r1.len==r2.len && r1.wei<r2.wei;
}

int main()
{
    int t,n;
    set <Node > se;
    scanf("%d",&t);
    while (t--)
    {
          se.clear();
          scanf("%d",&n);
          for (int j = 0;j<n;j++)
          {
              scanf("%d%d%d",&q.key,&q.len,&q.wei);
              if( q.len < q.wei ){ int c = q.len;q.len = q.wei;q.wei = c; }
              se.insert(q);
          }
         // printf("%d\n",se.size());
          for (set <Node > :: iterator i = se.begin();i != se.end();i++)
          printf("%d %d %d\n",i->key,i->len,i->wei);
    }
}