#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
#include<ctype.h>
#include<set>
#include<math.h>
#include<iostream>
using namespace std;
#define MAXN 15
int nline;
int arr[105];
int main()
{
scanf("%d", &nline);
int count = 0;
int num;
while(scanf("%d",&num)!=EOF)
{
arr[count++] = num;
}
sort(arr, arr + count);
int duan;
int chong;
for(int i=1;i<count;i++)
{
if (arr[i] == arr[i - 1])
chong = arr[i];
if (arr[i] - arr[i - 1] > 1)
duan = arr[i] - 1;
}
printf("%d %d\n", duan, chong);
}
错误票据
最新推荐文章于 2022-10-11 22:29:44 发布