Submission #14301

#TimeUsernameProblemLanguageResultExecution timeMemory
14301operaghost이상한 수열 (OJUZ10_bizarre)C++98
100 / 100
14 ms9092 KiB
#include <stdio.h>
#include <stdlib.h>
#define MIN(a,b)a<b?a:b
int a[50001],visit[2000002],mi=0x7fffffff;
int main()
{
    int n,i,m,cnt=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d",&a[i]);
        if(a[i]>=0&&visit[a[i]]==0)                 cnt++,visit[a[i]]=1;
        else if(a[i]<0&&visit[abs(a[i])+1000000]==0)cnt++,visit[abs(a[i])+1000000]=1;
        //if(a[i]>=0&&a[i]>=n&&a[i]<mi)mi=a[i];
    }
    for(i=1;i<=n;i++){
        if(a[i]>=0&&a[i]>=cnt&&a[i]<mi)mi=a[i];
    }
    scanf("%d",&m);
    //printf("%d %d\n",cnt,mi);
    if(m<=n)printf("%d",a[m]);
    else{
        if(n+mi-cnt+1<=m&&mi!=0x7fffffff)printf("%d",mi);
        else                             printf("%d",cnt+m-n-1);
    }
   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...