Submission #76603581


Source Code Expand

Copy
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
int cmp(const void* x, const void* y) {
int a = *(const int*)x, b = *(const int*)y;
return (a > b) - (a < b);
}
/* */
int cmp64(const void* x, const void* y) {
int64_t a = *(const int64_t*)x, b = *(const int64_t*)y;
return (a < b) - (a > b);
}
int N, K;
int A[312345];
int64_t meow[312345];
int main(void) {
int i;
int start = 0, cnt = 0;
int64_t ans = 0;
if (scanf("%d%d", &N, &K) != 2) return 1;
for (i = 0; i < N; i++) {
if (scanf("%d", &A[i]) != 1) return 1;
}
qsort(A, N, sizeof(*A), cmp);
for (i = 1; i <= N; i++) {
if (i >= N || A[i] != A[start]) {
meow[cnt++] = (int64_t)A[start] * (i - start);
start = i;
}
}
qsort(meow, cnt, sizeof(*meow), cmp64);
for (i = K; i < cnt; i++) {
ans += meow[i];
}
printf("%" PRId64 "\n", ans);
return 0;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return (a > b) - (a < b);
}

/* 降順 */
int cmp64(const void* x, const void* y) {
	int64_t a = *(const int64_t*)x, b = *(const int64_t*)y;
	return (a < b) - (a > b);
}

int N, K;
int A[312345];

int64_t meow[312345];

int main(void) {
	int i;
	int start = 0, cnt = 0;
	int64_t ans = 0;
	if (scanf("%d%d", &N, &K) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	qsort(A, N, sizeof(*A), cmp);
	for (i = 1; i <= N; i++) {
		if (i >= N || A[i] != A[start]) {
			meow[cnt++] = (int64_t)A[start] * (i - start);
			start = i;
		}
	}
	qsort(meow, cnt, sizeof(*meow), cmp64);
	for (i = K; i < cnt; i++) {
		ans += meow[i];
	}
	printf("%" PRId64 "\n", ans);
	return 0;
}

Submission Info

Submission Time
Task C - Vanish
User mikecat
Language C23 (GCC 14.2.0)
Score 300
Code Size 893 Byte
Status AC
Exec Time 68 ms
Memory 7424 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 31
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt
Case Name Status Exec Time Memory
sample00.txt AC 0 ms 1580 KiB
sample01.txt AC 1 ms 1716 KiB
sample02.txt AC 1 ms 1736 KiB
testcase00.txt AC 1 ms 1592 KiB
testcase01.txt AC 0 ms 1680 KiB
testcase02.txt AC 58 ms 6616 KiB
testcase03.txt AC 67 ms 7392 KiB
testcase04.txt AC 46 ms 5700 KiB
testcase05.txt AC 68 ms 7424 KiB
testcase06.txt AC 28 ms 4092 KiB
testcase07.txt AC 67 ms 7416 KiB
testcase08.txt AC 6 ms 1964 KiB
testcase09.txt AC 27 ms 3316 KiB
testcase10.txt AC 9 ms 2032 KiB
testcase11.txt AC 38 ms 3944 KiB
testcase12.txt AC 19 ms 2584 KiB
testcase13.txt AC 45 ms 3968 KiB
testcase14.txt AC 47 ms 3828 KiB
testcase15.txt AC 49 ms 3976 KiB
testcase16.txt AC 56 ms 3960 KiB
testcase17.txt AC 64 ms 4392 KiB
testcase18.txt AC 7 ms 2092 KiB
testcase19.txt AC 47 ms 3864 KiB
testcase20.txt AC 55 ms 3680 KiB
testcase21.txt AC 65 ms 4524 KiB
testcase22.txt AC 27 ms 3320 KiB
testcase23.txt AC 67 ms 7400 KiB
testcase24.txt AC 65 ms 4640 KiB
testcase25.txt AC 30 ms 3624 KiB
testcase26.txt AC 46 ms 4020 KiB
testcase27.txt AC 45 ms 4000 KiB


2026-06-13 (Sat)
07:34:11 +09:00