This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<set>
std::set<int> S;
int a[555555];
int main()
{
int i,n,m;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
S.insert(a[i]);
}
scanf("%d",&m);
for(i=1;i<=m;i++)
{
if(i>n)
{
a[i]=S.size();
S.insert(a[i]);
if(a[i]==a[i-1])
{
printf("%d",a[i]);
return 0;
}
}
}
printf("%d",a[m]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |