214652026-01-13 09:39:57bombinigusiniKéséscpp17Accepted 50/50119ms2064 KiB
#include <iostream>
#include <algorithm>
using namespace std;
struct ev{int evsz, idop;};
bool h(ev ev1, ev ev2)
{
    if(ev1.evsz==ev2.evsz)
    {
        return ev1.idop<ev2.idop;
    }
    else return ev1.evsz<ev2.evsz;
}

int main()
{
    int n;
    cin>>n;
    ev t[n];
    for (int i=0; i<n; i++)
    {
        cin>>t[i].evsz;
        t[i].idop=i;
    }
    sort(t,t+n,h);
    int x=200001;
    for(int i=0; i<n; i++)
    {
        if(t[i].evsz!=t[i+1].evsz and t[i].idop<x)
        {
            x=t[i].idop;
        }
    }
    cout<<x+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/08ms316 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms500 KiB
5Accepted5/578ms1804 KiB
6Accepted5/578ms1916 KiB
7Accepted4/494ms1816 KiB
8Accepted4/494ms1844 KiB
9Accepted4/497ms1956 KiB
10Accepted4/496ms2064 KiB
11Accepted4/494ms1928 KiB
12Accepted2/2118ms1952 KiB
13Accepted2/2115ms1820 KiB
14Accepted1/1115ms1848 KiB
15Accepted1/1115ms1844 KiB
16Accepted1/1115ms1844 KiB
17Accepted1/1116ms2036 KiB
18Accepted1/1119ms1844 KiB
19Accepted1/1119ms1844 KiB