This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<algorithm>
#define N 100002
long long int n,m,a[N],nn=1,b[N],mm;
int main(){
int i,j;
scanf("%lld",&n);
for(i=1;i<=n;i++){scanf("%lld",&a[i]);}
scanf("%lld",&m);
if(m<=n){
printf("%lld",a[m]);
}
else{
m=m-n;
std::sort(a+1,a+n+1);
b[1]=a[1];
for(i=2;i<=n;i++){
if(a[i-1]!=a[i]){
nn++;
b[nn]=a[i];
}
}
b[nn+1]=21000000000;
int g;
b[0]=-21000000000;
for(i=1;i<=nn+1;i++){
if(b[i-1]<nn&&nn<=b[i]){
g=i;
break;
}
}
nn+=(m-1);
if(nn>=b[g]){
printf("%lld",b[g]);
}
else{
printf("%lld",nn);
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |