# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13966 | gs14004 | 이상한 수열 (OJUZ10_bizarre) | C++14 | 0 ms | 0 KiB |
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 <cstdio>
#include <set>
using namespace std;
int n,a[100005];
set<int> s;
int main(){
scanf("%d",&n);
for (int i=0; i<n; i++) {
scanf("%d",&a[i]);
}
int m;
scanf("%d",&m);
if(m <= n){
printf("%d",a[m-1]);
return 0;
}
sort(a,a+n);
m -= n;
n = (int)(unique(a,a+n) - a);
int k = (int)(lower_bound(a,a+n,m) - a);
if(k == n){
printf("%d",m - n + 1);
return 0;
}
m--;
while (m && n < a[k]) {
n++;
m--;
}
printf("%d",n);
}