백준 c++ 16712 Finding Love

16712 Finding Love

문제풀이

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void fast_io(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int v, n, m;
vector<int> vec;
int main(void)
{
    fast_io();
    cin >> n >> m;
    for (int i = 0; i < n;i++)
    {
        int a;
        cin >> a;
        vec.push_back(a);
    }
    for (int i = 0; i < n - m + 1;i++)
    {
        cin >> v;
        sort(vec.begin(), vec.begin()+m);
        vec.erase(vec.begin() + v-1);

    }
    sort(vec.begin(), vec.end());
    for (int i = 0; i < vec.size();i++)
        cout << vec[i] << " ";
}

값을 받아서 m 만큼 정렬한뒤 v에 해당하는값을 지워주는것을 n-m+1 만큼 반복했다.