Blue cup 7 to 13 years (group B)-CodePudding

# include
# include
# include
using namespace std;
Int id [10010];//store ID

Int main () {
Int N;
int n;//said with duplicate ID
int m;//said break ID
scanf("%d",& N);
int i=0;
While ((the scanf (" % d ", & amp; Id [I]))! EOF)={
i++;
}

Sort (id, (id + I));
for(int j=0; JIf (id==[j] id [m + 1]) {
N=id [j];
break;
}
}
for(int j=0; JIf (id [j]! [j + 1)=(id - 1) & amp; & Id [j]! Id=[m + 1]) {
M=id [j] + 1;
break;

}
}
Printf (" % d % d ", m, n);
return 0;
}

CodePudding user response:

What are the requirements for the title, to achieve what kind of result, somehow you describe it,