Codeforces Round 560 Div. 3 B Polycarp Training

Codeforces Round 560 Div. 3 B Polycarp Training

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include<string>
#include <cstring> //memset
using namespace std;
const int MAX = 100000 + 2;
 
 
int main(void)
{
    vector<int> pq;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        pq.push_back(a);
    }
    sort(pq.begin(), pq.end());
    int k = 1;
    int cnt = 0;
    for (int i = 0; i < pq.size(); i++) {
        if (k <= pq[i]) {
            cnt++;
            k++;
        }
        else
            continue;
    }
 
 
    cout << cnt << endl;
 
    return 0;
}

출처:https://codeforces.com/contest/1165/problem/B

단순 구현문제였습니다.

벡터로 정렬을 한뒤 쉽게 풀어줄수 있는 문제였습니다.