C ++ set custom sorting rules (nyist 8)

Most C ++ containers are automatically sorted. Therefore, when you use these containers, the element types you add must be relatively large. If not, you need to customize the sorting rules, for example, your custom struct:

# Include <iostream> # include <set> using namespace std; struct ju {int id, x, y; bool operator <(const ju &) const // sort and repeat {if (id =. id) {if (x =. x) return y <. y; else return x <. x;} else return id <. id ;}} tt; set <ju> my; set <ju>: iterator it; int main (int argc, char * argv []) {int t, n, i, j; cin> t; while (t --) {cin> n; my. clear (); for (I = 0; I <n; I ++) {cin> tt. id> tt. x> tt. y; if (tt. x <tt. y) swap (tt. x, tt. y); my. insert (tt );} For (it = my. begin (); it! = My. end (); it ++) cout <(* it ). id <"" <(* it ). x <"" <(* it ). y <endl;} return 0 ;}