196772025-12-18 17:37:26GergoszaboBejgli (80 pont)cpp17Partially correct 48/8034ms2464 KiB
#include <iostream>
#include<bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n; cin >> n;
    vector<ll> v(n);
    for (ll i = 0; i < n; i++){
        cin >> v[i];
    }
    ll ans1 = 0;
    vector<ll> freq(n+1, 0);
    for (ll i = 0; i < n; i++){
        freq[v[i]]++;
    }
    ll maxind = -1, maxn = 0;
    for (ll i = 1; i < n; i++){
        freq[i] = freq[i] / i;
        ans1 += freq[i];
        if (freq[i] > maxn){
            maxn = freq[i]; maxind = 1;
        }
    }
    cout << ans1 << "\n" << maxind;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base48/80
1Accepted0/01ms512 KiB
2Accepted0/01ms316 KiB
3Partially correct2/41ms512 KiB
4Partially correct2/41ms316 KiB
5Partially correct2/41ms316 KiB
6Wrong answer0/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Partially correct2/41ms316 KiB
10Accepted4/41ms316 KiB
11Partially correct2/42ms316 KiB
12Partially correct2/42ms316 KiB
13Partially correct2/43ms316 KiB
14Accepted4/43ms564 KiB
15Partially correct2/44ms568 KiB
16Partially correct2/46ms564 KiB
17Partially correct2/413ms1184 KiB
18Accepted4/420ms2100 KiB
19Partially correct2/428ms2312 KiB
20Partially correct2/428ms2328 KiB
21Partially correct2/434ms2464 KiB
22Partially correct2/423ms2208 KiB