Submission #72090637

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>
struct meow {
  int id, cnt;
} data[114514];
int cmp(const void* x, const void* y) {
  struct meow a = *(const struct meow*)x, b = *(const struct meow*)y;
  int c = (a.cnt < b.cnt) - (a.cnt > b.cnt);
  return c ? c : (a.id > b.id) - (a.id < b.id);
}
int main(void) {
  int n, m;
  int i, j;
  if (scanf("%d%d", &n, &m) != 2) return 1;
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      int nyan;
      if (scanf("%d", &nyan) != 1) return 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

struct meow {
	int id, cnt;
} data[114514];

int cmp(const void* x, const void* y) {
	struct meow a = *(const struct meow*)x, b = *(const struct meow*)y;
	int c = (a.cnt < b.cnt) - (a.cnt > b.cnt);
	return c ? c : (a.id > b.id) - (a.id < b.id);
}

int main(void) {
	int n, m;
	int i, j;
	if (scanf("%d%d", &n, &m) != 2) return 1;
	for (i = 0; i < n; i++) {
		for (j = 0; j < m; j++) {
			int nyan;
			if (scanf("%d", &nyan) != 1) return 1;
			data[j].cnt += nyan;
		}
	}
	for (i = 0; i < m; i++) data[i].id = i + 1;
	qsort(data, m, sizeof(*data), cmp);
	for (i = 0; i < m; i++) printf(" %d" + !i, data[i].id);
	putchar('\n');
	return 0;
}

Submission Info

Judge Result