[BOJ][C++] 백준 25305 커트라인

방법 1: sort함수 default(오름차순)사용

#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
using namespace std;

int main()
{
	int N, k;
	cin >> N >> k;
	vector<int> vec(N);

	for (int i = 0; i < N; i++) {
		cin >> vec[i];
	}

	sort(vec.begin(), vec.end());
	cout << vec[vec.size() - k];
}

 

방법 2: sort함수 내림차순 정렬 

#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
using namespace std;

int main()
{
	int N, k;
	cin >> N >> k;
	vector<int> vec(N);

	for (int i = 0; i < N; i++) {
		cin >> vec[i];
	}

	sort(vec.begin(), vec.end(), greater<>());
	cout << vec[k-1];
}