Submission #14421

#	Time	Username	Problem	Language	Result	Execution time	Memory
14421		hakgb11	이상한 수열 (OJUZ10_bizarre)	C++98	8 / 100	15 ms	2112 KiB

bizarre

#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;

ll n, m, t;

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

		}
	}
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 24
• Subtask 3: 0 / 30
• Subtask 4: 0 / 38