#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[1000005];
int readin()
{
char c;
int ans=0;
while(c=getchar())
{
if(c>='0'&&c<='9')
{
ans=ans*10+c-'0';
}
else break;
}
return ans;
}
bool ok(int a1,int a2,int a3)
{
return a1>a3-a2;
}
bool judge()
{
if(n<=3)
return false;
if(ok(a[0],a[1],a[n-1]))
return false;
for(int i=2;i<n;i++)
{
if(ok(a[i-2],a[i-1],a[i]))
return true;
}
return false;
}
int main()
{
n=readin();
for(int i=0;i<n;i++)
{
a[i]=readin();
}
sort(a,a+n);
if(judge())
printf("The set is accepted.\n");
else
printf("The set is rejected.\n");
return 0;
}
这一题算是水体,考察输入的
但是似乎只能使用G++,我用c++教了n遍都是runtime limited