2567 2023. 01. 17 13:55:01 gkata Késés cpp17 Wrong answer 0/50 48ms 4564 KiB
#include <iostream>
//#include <fstream>
#include <vector>
#include <climits>
#define ll long long

using namespace std;

//ifstream cin("keses.in");
//ofstream cout("keses.out");

vector<ll>x;
vector<ll>y;
ll n,i,a,maxi=LLONG_MIN,pos;
int main()
{
    cin>>n;
    x.resize(10000);
    for(i=0;i<n;++i)
    {
        cin>>a;
        ++x[a];
    }
    for(auto &e:x) if(e) y.push_back(e);
    for(i=0;i<y.size();++i)
    {
        if(y[i]>maxi)
        {
            maxi=y[i];
            pos=i;
        }
    }

    cout<<pos+1;
    return 0;
}
Subtask Sum Test Verdict Time Memory
base 0/50
1 Accepted 0/0 3ms 2080 KiB
2 Wrong answer 0/0 8ms 2528 KiB
3 Wrong answer 0/5 2ms 2492 KiB
4 Wrong answer 0/5 2ms 2684 KiB
5 Wrong answer 0/5 48ms 2980 KiB
6 Wrong answer 0/5 48ms 3180 KiB
7 Runtime error 0/4 2ms 3224 KiB
8 Runtime error 0/4 2ms 3464 KiB
9 Runtime error 0/4 2ms 3716 KiB
10 Runtime error 0/4 2ms 3924 KiB
11 Runtime error 0/4 2ms 3868 KiB
12 Runtime error 0/2 2ms 3992 KiB
13 Runtime error 0/2 2ms 4076 KiB
14 Runtime error 0/1 2ms 4208 KiB
15 Runtime error 0/1 2ms 4280 KiB
16 Runtime error 0/1 2ms 4280 KiB
17 Runtime error 0/1 2ms 4360 KiB
18 Runtime error 0/1 2ms 4484 KiB
19 Runtime error 0/1 2ms 4564 KiB