Submission #71404213

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <stdlib.h>
int N, M;
struct sankasya_s {
  int id;
  int S, E;
} sankasya[114514];
int cmp(const void* x, const void* y) {
  struct sankasya_s a = *(const struct sankasya_s*)x, b = *(struct sankasya_s*)y;
  long long ta = (long long)a.S * M + a.E;
  long long tb = (long long)b.S * M + b.E;
  if (ta != tb) return (ta > tb) - (ta < tb);
  return (a.id > b.id) - (a.id < b.id);
}
int main(void) {
  int i;
  if (scanf("%d%d", &N, &M) != 2) return 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>

int N, M;

struct sankasya_s {
	int id;
	int S, E;
} sankasya[114514];

int cmp(const void* x, const void* y) {
	struct sankasya_s a = *(const struct sankasya_s*)x, b = *(struct sankasya_s*)y;
	long long ta = (long long)a.S * M + a.E;
	long long tb = (long long)b.S * M + b.E;
	if (ta != tb) return (ta > tb) - (ta < tb);
	return (a.id > b.id) - (a.id < b.id);
}

int main(void) {
	int i;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d%d", &sankasya[i].S, &sankasya[i].E) != 2) return 1;
		sankasya[i].id = i + 1;
	}
	qsort(sankasya, N, sizeof(*sankasya), cmp);
	for (i = 0; i < N; i++) {
		printf(" %d" + !i, sankasya[i].id);
	}
	putchar('\n');
	return 0;
}

Submission Info

Judge Result