Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- enum { MAXN = 16384 };
- struct St
- {
- double x;
- int ord;
- int y;
- };
- typedef struct St st;
- int cmp(const void *a, const void *b) {
- st f = *((st*)a);
- st s = *((st*)b);
- if (f.x != s.x) {
- if (f.x < s.x) {
- return -1;
- } else if (f.x > s.x) {
- return 1;
- } else {
- return 0;
- }
- }
- if (f.ord != s.ord) {
- return f.ord - s.ord;
- }
- return f.y - s.y;
- }
- int
- main(void) {
- st data[MAXN];
- double x;
- int y;
- int ptr = 0;
- while (scanf("%lf %d", &x, &y) == 2) {
- data[ptr].x = x;
- data[ptr].ord = ptr;
- data[ptr].y = y;
- ptr++;
- }
- qsort(data, ptr, sizeof(*data), cmp);
- for (int i = 0; i < ptr; i++) {
- printf("%.10g %d\n", data[i].x, data[i].y);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement