Submission #3050403
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <vector> #include <utility> #include <cmath> #include <functional> #include <queue> #include <climits> #define REP(i,n) for(int i=0;i<n;i++) #define FOR(i,n1,n2) for(int i=n1;i<n2;i++) #define put(a) cout<<a<<endl; using namespace std; typedef long long ll; //typedef unsigned long long ull; typedef pair<int, int> P; int k,n; int main() { cin >> n >> k; vector<int> a(n); vector<int> b(n,0); REP(i,n){ cin >> a[i]; b[a[i]-1]++; } sort(b.begin(),b.end(),greater<int>()); int res = 0; FOR(i,k,n){ res += b[i]; } put(res); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Not so Diverse |
User | idaten |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 704 Byte |
Status | AC |
Exec Time | 64 ms |
Memory | 1792 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 | 1 ms | 256 KB |
10.txt | AC | 63 ms | 1792 KB |
11.txt | AC | 63 ms | 1792 KB |
12.txt | AC | 63 ms | 1792 KB |
13.txt | AC | 58 ms | 1664 KB |
2.txt | AC | 1 ms | 256 KB |
3.txt | AC | 63 ms | 1792 KB |
4.txt | AC | 64 ms | 1792 KB |
5.txt | AC | 62 ms | 1792 KB |
6.txt | AC | 57 ms | 1664 KB |
7.txt | AC | 60 ms | 1664 KB |
8.txt | AC | 60 ms | 1792 KB |
9.txt | AC | 64 ms | 1792 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |