#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int cmp(const void *a, const void *b)
{
return *(int *)a - *(int *)b;
}
int main()
{
int m, n;
int N;
int b[100006];
cin >> N;
int sum = 0;
while (N--)
{
while (1)
{
int a;
char ch;
cin >> a;
b[sum++] = a;
ch = getchar();
if (ch != ' ') break;
}
}
qsort(b, sum, sizeof(int), cmp);
for (int i = 0; i < sum-1; i++)
{
if (b[i] - b[i+1] == -2) m = b[i] + 1;
if (b[i] == b[i+1]) n = b[i];
}
cout << m << ' ' << n << endl;
system("PAUSE");
return 0;
}
蓝桥杯~~~~~错误票据
最新推荐文章于 2022-09-05 12:51:25 发布