Submission #1874156


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------






int N, A[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    rep(i, 0, N) cin >> A[i];

    map<int, int> cnt;
    rep(i, 0, N) cnt[A[i]]++;

    int ans = 0;
    fore(p, cnt) {
        if (p.first == p.second) continue;
        if (p.first < p.second) ans += p.second - p.first;
        else ans += p.second;
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - Good Sequence
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 300
Code Size 839 Byte
Status AC
Exec Time 42 ms
Memory 5120 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 5
AC × 18
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 7 ms 640 KB
1_03.txt AC 9 ms 640 KB
1_04.txt AC 10 ms 640 KB
1_05.txt AC 10 ms 640 KB
1_06.txt AC 12 ms 640 KB
1_07.txt AC 10 ms 640 KB
1_08.txt AC 16 ms 1536 KB
1_09.txt AC 23 ms 2560 KB
1_10.txt AC 28 ms 3456 KB
1_11.txt AC 36 ms 4352 KB
1_12.txt AC 42 ms 5120 KB