{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n\t\u003cp\u003eIn the world of algorithms and coordinates, Khaleque embarked on a journey with a main theme: given n points in a two-dimensional space, his quest was to orchestrate order. Armed with code and precision, Khaleque meticulously sorted all the points in ascending harmony, unveiling the beauty of organized spatial arrangements. In this digital tale, Khaleque found elegance in the art of arrangement, shaping the narrative of points in a symphony of ascending order\u003c/p\u003e\n\u003cpre\u003e (x1, y1) \u0026gt; (x2, y2) if and only if (x1 \u0026gt; x2) or (x1 \u003d\u003d x2 and y1 \u0026lt; y2) \u003c/pre\u003e\n\n\u003ch3\u003eInput\u003c/h3\u003e\n\u003cp\u003eThe first line consists of an integer t, the number of test cases. Then for each test case the first line consists of an integer n, the number of points. Then the next n lines contains two integers xi, yi which represents the point.\u003c/p\u003e\n\n\u003ch3\u003eOutput\u003c/h3\u003e\n\u003cp\u003eFor each test case print the sorted order of the points.\u003c/p\u003e\n\n\u003ch3\u003eConstraints\u003c/h3\u003e\n\u003cp\u003e1 \u0026lt;\u003d t \u0026lt;\u003d 10\u003c/p\u003e\n\u003cp\u003e1 \u0026lt;\u003d n \u0026lt;\u003d 100000\u003c/p\u003e\n\u003cp\u003e-10^9 \u0026lt;\u003d coordinates \u0026lt;\u003d 10^9\u003c/p\u003e\n\n\u003cp\u003e\u003cstrong\u003eNOTE: Strict time limit. Prefer scanf/printf/BufferedReader instead of cin/cout/Scanner.\u003c/strong\u003e\u003c/p\u003e\n\n\u003ch3\u003eExample\u003c/h3\u003e\n\u003cdiv\u003e\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1\n5\n3 4\n-1 2\n5 -3\n3 3\n-1 -2\n\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e-1 2\n-1 -2\n3 4\n3 3\n5 -3\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e\n\n\u003c/div\u003e"}}]}