Submission #73910732

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;

// N.size = 1,..N
// Ball i = A[i]
// Q operations
// Q = 0, Q < N, Q++
// K.size = sum(B_1, B_2,..B_k)
// For each Q, 

int main() {
    int n, q;
    if (!(cin >> n >> q)) return 0;

    //vector of pairs to keep value and the original ball ID together
    vector<pii> balls(n);
    for (int i = 0; i < n; i++) {
        int val;
        cin >> val;
        balls[i] = {val, i + 1};
    }

    sort(balls.begin(), balls.end());

    for (int i = 0; i < q; i++) {
        int k;
        cin >> k;

        vi removed(k);
        for (int j = 0; j < k; j++) {
            cin >> removed[j];
        }

        for (int j = 0; j < n; j++) {
            bool is_removed = false;
            
            for (int r = 0; r < k; r++) {
                if (balls[j].second == removed[r]) {
                    is_removed = true;
                    break;
                }
            }

            if (!is_removed) {
                cout << balls[j].first << "\n";
                break; 
            }
        }
    }

    return 0;
}

Submission Info

Judge Result