137542025-01-08 16:53:44MrkzKéséscpp17Wrong answer 22/50151ms65536 KiB
#include <iostream>

using namespace std;
int n,maxi;
int main()
{
    cin>>n;
    long long evsz[n+1];
    for(int i=1;i<=n;i++){
        cin>>evsz[i];
        if(maxi<evsz[i])
            maxi=evsz[i];
    }
    long long elof[maxi]={0};
    int megoldas=1;
    for(int i=1;i<=n;i++){
        elof[evsz[i]]++;
    }
    while(elof[evsz[megoldas]]>1){
        megoldas++;
    }
    cout<<megoldas;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base22/50
1Wrong answer0/01ms316 KiB
2Accepted0/07ms564 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Runtime error0/548ms1848 KiB
6Runtime error0/548ms1976 KiB
7Accepted4/470ms3360 KiB
8Accepted4/470ms3480 KiB
9Wrong answer0/471ms3380 KiB
10Accepted4/471ms3380 KiB
11Runtime error0/471ms3380 KiB
12Runtime error0/2141ms65536 KiB
13Runtime error0/2150ms65536 KiB
14Runtime error0/1141ms65536 KiB
15Runtime error0/1141ms65536 KiB
16Runtime error0/1150ms65536 KiB
17Runtime error0/1140ms65536 KiB
18Runtime error0/1151ms65536 KiB
19Runtime error0/1141ms65536 KiB