137112025-01-08 13:29:26AGergoKéséscpp17Accepted 50/50331ms17224 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    cin.tie(0);
    iostream::sync_with_stdio(0);

    int n; cin>> n;

    set<int> evek;
    map<int,int> utolso;

    int x;

    for(int i =1;i <n+1;i++)
    {
        cin >> x;
        evek.insert(x);
        utolso[x] = i;
    }
    int mini = INT_MAX;
    for(int y:evek)
    {
        if(utolso[y] < mini)
        {
            mini = utolso[y];
        }
    }

    cout << mini;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/010ms1076 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/550ms512 KiB
6Accepted5/550ms512 KiB
7Accepted4/4233ms12220 KiB
8Accepted4/4202ms11908 KiB
9Accepted4/4208ms10292 KiB
10Accepted4/4171ms9024 KiB
11Accepted4/4172ms7808 KiB
12Accepted2/2166ms8360 KiB
13Accepted2/2277ms17224 KiB
14Accepted1/1331ms16948 KiB
15Accepted1/1312ms16644 KiB
16Accepted1/1231ms13384 KiB
17Accepted1/1172ms9268 KiB
18Accepted1/182ms1120 KiB
19Accepted1/175ms820 KiB