214642026-01-13 09:37:13badamKéséscpp17Accepted 50/5061ms1984 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct ev{int evszam, ido;};
bool h(ev ev1, ev ev2)
{
    if(ev1.evszam==ev2.evszam)
    {
        return ev1.ido<ev2.ido;
    }
    else return ev1.evszam<ev2.evszam;
}
int main()
{   ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    ev t[n];
    for(int i=0;i<n;i++)
    {
        cin >> t[i].evszam;
        t[i].ido=i;
    }
    sort(t,t+n,h);
    int x=200001;
    for(int i=0;i<n;i++)
    {
        if(t[i].evszam!=t[i+1].evszam and t[i].ido<x)
        {
            x=t[i].ido;

        }
    }
    cout << x+1;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/06ms572 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/552ms1980 KiB
6Accepted5/552ms1980 KiB
7Accepted4/454ms1800 KiB
8Accepted4/454ms1844 KiB
9Accepted4/454ms1980 KiB
10Accepted4/454ms1984 KiB
11Accepted4/454ms1944 KiB
12Accepted2/259ms1980 KiB
13Accepted2/257ms1768 KiB
14Accepted1/157ms1984 KiB
15Accepted1/157ms1984 KiB
16Accepted1/157ms1980 KiB
17Accepted1/157ms1976 KiB
18Accepted1/161ms1912 KiB
19Accepted1/161ms1980 KiB