描述
Whoooa! There is a spy in Marjar University. All we know is that the spy has a special ID card. Please find him out!
输入
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:
The first line contains a integer N (3 <= N <= 100), which describes that there are N students need to be checked.
The second line contains N integers indicating the ID card number of N students. All ID card numbers are 32-bit integers.
输出
For each test case, output the ID card number which is different from others.
样例输入
3
10
1 1 1 1 1 1 1 1 6 1
3
9 9 8
5
90016 90016 90016 2009 90016
样例输出
6
8
2009
排序 排序 排序 sort sort sort ，别再冒泡了，哦哦，对了，头文件是#include <algorithm>
#include <stdio.h> #include <algorithm> using namespace std; int main() { int i,n,s; int a[101]; scanf("%d",&s); while(s--) { scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); if(a[0]==a[1]) printf("%d ",a[n-1]); else printf("%d ",a[0]); } }