Submission #14683

#TimeUsernameProblemLanguageResultExecution timeMemory
14683atomzeno이상한 수열 (OJUZ10_bizarre)C++98
62 / 100
15 ms1864 KiB
#include<stdio.h> #include<algorithm> #define N 100002 int n,m,a[N],nn=1,b[N],mm; int main(){ int i,j; scanf("%d",&n); for(i=1;i<=n;i++){scanf("%d",&a[i]);} scanf("%d",&m); if(m<=n){ printf("%d",a[m]); } else{ m=m-n; std::sort(a+1,a+n+1); for(i=2;i<=n;i++){ if(a[i-1]!=a[i]){ nn++; b[nn]=a[i]; } } b[nn+1]=2100000000; int g; b[0]=-2100000000; for(i=1;i<=n+1;i++){ if(b[i-1]<nn&&nn<=b[i]){ g=i; break; } } nn+=(m-1); if(nn>=b[g]){ printf("%d",b[g]); } else{ printf("%d",nn); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...