Missing number in array

Given an array of size n-1 and given that there are numbers from 1 to n with one missing, the missing number is to be found.

Input:

The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N.
The second line of each test case contains N-1 input C[i],numbers in array.

Output:

Print the missing number in array.

Constraints:

1 ≤ T ≤ 200
1 ≤ N ≤ 1000
1 ≤ C[i] ≤ 1000

Example:

Input
2
5
1 2 3 5
10
1 2 3 4 5 6 7 8 10

Output
4
9

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int N,i;
        cin>>N;
        int *C=new int[N-1];
        for(i=0;i<(N-1);i++)
            cin>>C[i];
        sort(C,C+N-1);
        for(i=0;i<N-1;i++)
        {
            if(C[i]!=i+1)
            {
                cout<<i+1<<endl;
                break;
            }
        }
        if(N==1)
            cout<<"1"<<endl;
        if(i == N-1)
            cout<<i+1<<endl;
    }
    return 0;
}