Missing number

Missing number

题目：

Description

There is a permutation without two numbers in it, and now you know what numbers the permutation has. Please find the two numbers it lose.

 

Input

There is a number T shows there are T test cases below. (T≤10) 
For each test case , the first line contains a integers n , which means the number of numbers the permutation has. In following a line , there are n distinct postive integers.(1≤n≤1,000)

 

Output

For each case output two numbers , small number first.

 

Sample Input

2

3

3 4 5

1

1

 

Sample Output

1 2

2 3

题意：

有一个长度为n+2的排列少了两数，找出这两个数，要求这两个数是最小的。

分析：

定义一个数组a，并且将它清零，如果数组中有数字x就将1赋值a[x]，

后从i=1开始查找如果a[i]为零就将i输出。

说明：注意输出的格式和输出的个数。

#include<iostream>
#include<cstring>
using namespace std;
const int maxn=1000;
int a[maxn];
int main()
{
int T,n,x,j;
int b[5];
cin>>T;
while(T--)
{
    memset(a,0,sizeof(a));
 cin>>n;
for(int i=0;i<n;i++)
{cin>>x;
a[x]=1;
}
j=0;
for(int k=1;k<=n+2;k++)
if(!a[k])
b[j++]=k;
cout<<b[0]<<' '<<b[1]<<endl;
}
return 0;
}