Submission #1987846
Source Code Expand
N,K = map(int,input().split()) A_list = list(map(int,input().split())) counter = [0]*(N+1) for i in A_list: counter[i] += 1 zeronashi = [i for i in counter if i != 0] zeronashi.sort() length = len(zeronashi) x = length - K y = 0 if x < 1: print(0) else: for i in range(x): y += zeronashi[i] print(y)
Submission Info
Submission Time | |
---|---|
Task | C - Not so Diverse |
User | antimatter |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 344 Byte |
Status | AC |
Exec Time | 127 ms |
Memory | 24836 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | AC | 17 ms | 2940 KB |
10.txt | AC | 93 ms | 24460 KB |
11.txt | AC | 93 ms | 24716 KB |
12.txt | AC | 127 ms | 24744 KB |
13.txt | AC | 86 ms | 24048 KB |
2.txt | AC | 17 ms | 3064 KB |
3.txt | AC | 92 ms | 24744 KB |
4.txt | AC | 95 ms | 24836 KB |
5.txt | AC | 89 ms | 23044 KB |
6.txt | AC | 83 ms | 22040 KB |
7.txt | AC | 83 ms | 22368 KB |
8.txt | AC | 88 ms | 24748 KB |
9.txt | AC | 93 ms | 24400 KB |
sample1.txt | AC | 17 ms | 3060 KB |
sample2.txt | AC | 17 ms | 3064 KB |
sample3.txt | AC | 17 ms | 2940 KB |