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 <stdio.h>
#include <vector>
#include <algorithm>
std::vector<int> arr;
int main()
{
int a, p, q, n, m, i;
scanf("%d", &n);
arr.reserve(n);
for(i=0;i<n;i++)
{
scanf("%d", &a);
arr.push_back(a);
}
scanf("%d", &m);
if(m<=n)
{
printf("%d", arr[m-1]);
return 0;
}
std::sort(arr.begin(), arr.end());
arr.erase(std::unique(arr.begin(), arr.end()), arr.end());
p=arr.size();
q=*std::lower_bound(arr.begin(), arr.end(), p);
printf("%d", std::min(p+m-n-1, q));
return 0;
}
# | 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... |