B. Unique Bid Auction (codeforces round #686)

B. Unique Bid Auction

题目：

There is a game called “Unique Bid Auction”. You can read more about it here: https://en.wikipedia.org/wiki/Unique_bid_auction (though you don’t have to do it to solve this problem).

Let’s simplify this game a bit. Formally, there are n participants, the i-th participant chose the number ai. The winner of the game is such a participant that the number he chose is unique (i. e. nobody else chose this number except him) and is minimal (i. e. among all unique values of a the minimum one is the winning one).

Your task is to find the index of the participant who won the game (or -1 if there is no winner). Indexing is 1-based, i. e. the participants are numbered from 1 to n.

You have to answer t independent test cases.

input:

The first line of the input contains one integer t (1≤t≤2⋅104) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1≤n≤2⋅105) — the number of participants. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤n), where ai is the i-th participant chosen number.

It is guaranteed that the sum of n does not exceed 2⋅105 (∑n≤2⋅105).

output:

For each test case, print the answer — the index of the participant who won the game (or -1 if there is no winner). Note that the answer is always unique.

example

input:
6
2
1 1
3
2 1 3
4
2 2 2 3
1
1
5
2 3 2 4 2
6
1 1 5 5 4 4
output:
-1
2
4
1
2
-1

题意：

找出一窜数中独一无二，最小的那个，不存在就输出-1；

思路：

先判断出现次数，再求最小

#include<bits/stdc++.h>
using namespace std;
int us[2000005]={0};
int a[200005];
int main(){
	int t;
	cin>>t;
	for(int i=1;i<=t;i++){
		int n;
		cin>>n;
		
		for(int j=1;j<=n;j++){
			cin>>a[j];
			us[a[j]]++;
		}
		int minn=10000000;
		int p;
		for(int j=1;j<=n;j++){
			if(us[a[j]]==1&&a[j]<minn){
				minn=a[j];
				p=j;
			}
			us[a[j]]=0;
		}
		if(minn==10000000)
		cout<<"-1"<<endl;
		else
		cout<<p<<endl;
	}
}