Submission #3027349


Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(a) (a).begin(), (a).end()

int main() {
    int N, a;
    map<int, int> mii;
    cin >> N;
    REP(i, N) {
        cin >> a;
        mii[a]++;
    }
    int ans = 0;
    for (auto p : mii) {
        if (p.first > p.second) ans += p.second;
        else if (p.first < p.second) ans += (p.second - p.first);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Good Sequence
User shiita0903
Language C++14 (GCC 5.4.1)
Score 300
Code Size 814 Byte
Status AC
Exec Time 74 ms
Memory 4736 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 16 ms 256 KB
1_03.txt AC 29 ms 256 KB
1_04.txt AC 32 ms 256 KB
1_05.txt AC 32 ms 256 KB
1_06.txt AC 44 ms 256 KB
1_07.txt AC 29 ms 256 KB
1_08.txt AC 37 ms 1152 KB
1_09.txt AC 46 ms 2048 KB
1_10.txt AC 55 ms 2944 KB
1_11.txt AC 65 ms 3968 KB
1_12.txt AC 74 ms 4736 KB