Submission #13926

#TimeUsernameProblemLanguageResultExecution timeMemory
13926model_code이상한 수열 (OJUZ10_bizarre)C++98
100 / 100
14 ms1280 KiB
#include<stdio.h> #include<algorithm> using namespace std; int n, ba[50050], k, m; // num is a b c ...(k) p q .. z : a b c .. p q .. z k k+1 ... p p p p int main(){ int i; scanf("%d", &n); for(i=1; i<=n; i++)scanf("%d", &ba[i]); scanf("%d", &m); if(m<=n){ printf("%d", ba[m]); return 0; } sort(ba+1, ba+n+1); k=unique(ba+1, ba+n+1)-(ba+1); for(i=1; i<=k; i++){ if(ba[i]>=k)break; } if(i==k+1)printf("%d", k+(m-n-1)); else if(k+(m-n-1)<=ba[i])printf("%d", k+(m-n-1)); else printf("%d", ba[i]); 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...