Jobdu 1052 找x

题目大意：中文

题目链接

代码：

/*                                                   
 * Problem ID : Jobdu 1052 找x
 * Author     : Lirx.t.Una                                                   
 * Language   : C++                                  
 * Run Time   : 0 ms                                                   
 * Run Memory : 1524 KB                                                   
*/ 

#include <iostream>
#include <cstdio>
#include <map>

using namespace std;

int
main() {
	
	int		n;
	int		i;
	int		a;
	int		x;
	
	while ( ~scanf("%d", &n) ) {
		
		map<int, int>	mp;
		
		for ( i = 1; i <= n; i++ ) {
			
			scanf("%d", &a);
			mp[a] = i;
		}
		scanf("%d", &x);
		
		if ( !mp[x] ) puts("-1");
		else printf("%d\n", mp[x] - 1);
	}
	
	return 0;
}