Submission #77326949

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
struct hs_s {
  int C, V;
};
int cmp_hs(const void* x, const void* y) {
  struct hs_s a = *(const struct hs_s*)x, b = *(const struct hs_s*)y;
  return (a.V < b.V) - (a.V > b.V);
}
struct info_s {
  int V, idx;
};
int cmp_info(const void* x, const void* y) {
  struct info_s a = *(const struct info_s*)x, b = *(const struct info_s*)y;
  return (a.V < b.V) - (a.V > b.V);
}
int N, K, M;
struct hs_s hs[212345];
struct info_s maxes[212345];
int main(void) {
  int i;
  uint64_t ans = 0;
  if (scanf("%d%d%d", &N, &K, &M) != 3) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%d%d", &hs[i].C, &hs[i].V) != 2) return 1;
    if (maxes[hs[i].C].V < hs[i].V) {
      maxes[hs[i].C].V = hs[i].V;
      maxes[hs[i].C].idx = i;
    }
  }
  qsort(maxes + 1, N, sizeof(*maxes), cmp_info);
  for (i = 1; i <= M; i++) {
    ans += maxes[i].V;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

struct hs_s {
	int C, V;
};

int cmp_hs(const void* x, const void* y) {
	struct hs_s a = *(const struct hs_s*)x, b = *(const struct hs_s*)y;
	return (a.V < b.V) - (a.V > b.V);
}

struct info_s {
	int V, idx;
};

int cmp_info(const void* x, const void* y) {
	struct info_s a = *(const struct info_s*)x, b = *(const struct info_s*)y;
	return (a.V < b.V) - (a.V > b.V);
}

int N, K, M;
struct hs_s hs[212345];

struct info_s maxes[212345];

int main(void) {
	int i;
	uint64_t ans = 0;
	if (scanf("%d%d%d", &N, &K, &M) != 3) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d%d", &hs[i].C, &hs[i].V) != 2) return 1;
		if (maxes[hs[i].C].V < hs[i].V) {
			maxes[hs[i].C].V = hs[i].V;
			maxes[hs[i].C].idx = i;
		}
	}
	qsort(maxes + 1, N, sizeof(*maxes), cmp_info);
	for (i = 1; i <= M; i++) {
		ans += maxes[i].V;
		hs[maxes[i].idx].V = 0;
	}
	qsort(hs + 1, N, sizeof(*hs), cmp_hs);
	for (i = 1; i <= K - M; i++) {
		ans += hs[i].V;
	}
	printf("%" PRIu64 "\n", ans);
	return 0;
}

/*

1. 色ごとの最大価値のやつを計算
2. それらのうち上位 M 個を取る
3. 残りの中から貪欲に K - M 個を取る

*/

Submission Info

Judge Result