196792025-12-18 17:41:52GergoszaboBejgli (80 pont)cpp17Accepted 80/8034ms1964 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 = i;
        }
    }
    cout << ans1 << "\n" << maxind;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/01ms508 KiB
2Accepted0/01ms316 KiB
3Accepted4/41ms316 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms396 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms320 KiB
11Accepted4/42ms316 KiB
12Accepted4/42ms316 KiB
13Accepted4/42ms316 KiB
14Accepted4/43ms316 KiB
15Accepted4/44ms652 KiB
16Accepted4/44ms564 KiB
17Accepted4/412ms1164 KiB
18Accepted4/420ms1964 KiB
19Accepted4/428ms1960 KiB
20Accepted4/428ms1964 KiB
21Accepted4/434ms1964 KiB
22Accepted4/423ms1964 KiB