Submission #14419

# Submission time Handle Problem Language Result Execution time Memory
14419 2015-05-14T08:01:31 Z hakgb11 이상한 수열 (OJUZ10_bizarre) C++
8 / 100
14 ms 1916 KB
#include <iostream>
#include <fstream>
#include <string>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <limits.h>

typedef long long ll;
using namespace std;

int n, m, t;

int main()
{
#ifdef _CONSOLE
	freopen("input.txt", "r", stdin);
#endif
	int n;
	scanf("%d", &n);
	vector<int> vi(n);
	for (int i = 0; i < n; i++){
		scanf("%d", &vi[i]);
	}
	scanf("%d", &m);
	if (m <= n){
		printf("%d\n", vi[m - 1]);
		return 0;
	}
	sort(vi.begin(), vi.end());
	vi.resize(unique(vi.begin(), vi.end()) - vi.begin());
	vector<int>::iterator itor = upper_bound(vi.begin(), vi.end(), vi.size());
	
	if (itor == vi.end()){
		printf("%d\n", (m - n) + (vi.size() - 1));
	}
	else{
		if((*itor - vi.size() + 1) + n <= m)
			printf("%d\n", *itor);
		else{
			printf("%d\n", (m - n) + (vi.size() - 1));

		}
	}
}

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1720 KB Output is correct
2 Correct 0 ms 1720 KB Output is correct
3 Correct 0 ms 1720 KB Output is correct
4 Correct 0 ms 1720 KB Output is correct
5 Correct 0 ms 1720 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1720 KB Output is correct
2 Correct 0 ms 1720 KB Output is correct
3 Incorrect 0 ms 1720 KB Output isn't correct
4 Correct 0 ms 1720 KB Output is correct
5 Incorrect 0 ms 1720 KB Output isn't correct
6 Correct 0 ms 1720 KB Output is correct
7 Correct 0 ms 1720 KB Output is correct
8 Correct 0 ms 1720 KB Output is correct
9 Incorrect 0 ms 1720 KB Output isn't correct
10 Correct 0 ms 1720 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 1916 KB Output is correct
2 Correct 6 ms 1916 KB Output is correct
3 Correct 0 ms 1720 KB Output is correct
4 Correct 0 ms 1720 KB Output is correct
5 Incorrect 0 ms 1720 KB Output isn't correct
6 Incorrect 13 ms 1916 KB Output isn't correct
7 Correct 9 ms 1916 KB Output is correct
8 Correct 6 ms 1908 KB Output is correct
9 Correct 9 ms 1916 KB Output is correct
10 Correct 5 ms 1916 KB Output is correct
11 Correct 7 ms 1916 KB Output is correct
12 Correct 4 ms 1872 KB Output is correct
13 Correct 0 ms 1720 KB Output is correct
14 Incorrect 3 ms 1720 KB Output isn't correct
15 Correct 0 ms 1880 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 1916 KB Output isn't correct
2 Correct 6 ms 1916 KB Output is correct
3 Correct 5 ms 1720 KB Output is correct
4 Correct 13 ms 1916 KB Output is correct
5 Incorrect 0 ms 1720 KB Output isn't correct
6 Correct 11 ms 1916 KB Output is correct
7 Correct 13 ms 1916 KB Output is correct
8 Correct 4 ms 1880 KB Output is correct
9 Correct 9 ms 1908 KB Output is correct
10 Correct 3 ms 1720 KB Output is correct
11 Incorrect 14 ms 1916 KB Output isn't correct
12 Incorrect 14 ms 1916 KB Output isn't correct
13 Correct 7 ms 1872 KB Output is correct
14 Incorrect 3 ms 1720 KB Output isn't correct
15 Correct 0 ms 1720 KB Output is correct