Submission #14129

#TimeUsernameProblemLanguageResultExecution timeMemory
14129gs13105이상한 수열 (OJUZ10_bizarre)C++98
8 / 100
16 ms1776 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...