Submission #13967

#TimeUsernameProblemLanguageResultExecution timeMemory
13967gs14004이상한 수열 (OJUZ10_bizarre)C++14
8 / 100
15 ms1472 KiB
#include <cstdio>
#include <algorithm>
using namespace std;

int n,a[100005];

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);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...