제출 #14032

#제출 시각아이디문제언어결과실행 시간메모리
14032baneling100이상한 수열 (OJUZ10_bizarre)C++98
62 / 100
15 ms1276 KiB
#include <stdio.h>
#include <algorithm>
#define INF 0x7fffffff

using namespace std;

int N, S[50001], M, K, Ans=INF;

int main(void) {

    int i;

    scanf("%d",&N);
    for(i=1 ; i<=N ; i++) scanf("%d",&S[i]);
    sort(S+1,S+N+1);
    scanf("%d",&M);
    S[0]=-INF;
    for(i=1 ; i<=N ; i++)
        if(S[i]!=S[i-1]) K++;
    Ans=K+M-N-1;
    for(i=1 ; i<=N ; i++) if(K<=S[i] && S[i]<=K+M-N-1 && Ans>S[i]) Ans=S[i];
    printf("%d",Ans);
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...