Submission #19,695

19695

2025-12-19 09:24:54

cpp17

Accepted 50/50

215ms

8892 KiB

#include <iostream>
#include <algorithm>
#include <climits>
#include <map>

using namespace std;

int t, n, mini = 200001,p;

map <int,int> v;

int main()
{
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> t;
		if (!v.insert(make_pair(t, i)).second)
			v[t] = i;

	}
	for (auto&i: v)
	{
		if (mini > i.second)
			mini = i.second;
	}
	cout << mini;

}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	492 KiB
		2	Accepted	0/0	12ms	564 KiB
		3	Accepted	5/5	1ms	316 KiB
		4	Accepted	5/5	1ms	316 KiB
		5	Accepted	5/5	82ms	440 KiB
		6	Accepted	5/5	82ms	448 KiB
		7	Accepted	4/4	172ms	6160 KiB
		8	Accepted	4/4	164ms	5996 KiB
		9	Accepted	4/4	163ms	5172 KiB
		10	Accepted	4/4	164ms	4660 KiB
		11	Accepted	4/4	162ms	3892 KiB
		12	Accepted	2/2	184ms	4436 KiB
		13	Accepted	2/2	211ms	8892 KiB
		14	Accepted	1/1	215ms	8500 KiB
		15	Accepted	1/1	208ms	8292 KiB
		16	Accepted	1/1	207ms	6716 KiB
		17	Accepted	1/1	187ms	4656 KiB
		18	Accepted	1/1	149ms	1068 KiB
		19	Accepted	1/1	142ms	564 KiB