#include <bits/stdc++.h> using namespace std; #define fi first #define se second #define ll long long #ifdef LOCAL #include "algo/debug.h" #else #define debug(...) 42 #endif template <class T> bool ckmax(T &a, T b) { return a < b ? (a = b, true) : false; } template <class T> bool ckmin(T &a, T b) { return a > b ? (a = b, true) : false; } const int MAXN = 2e5 + 5; int n, k; pair<int, int> e[MAXN]; namespace sub1 { int bit[MAXN], dp[MAXN]; vector<int> comp; void add(int i, int v) { for (; i > 0; i -= i & -i) ckmax(bit[i], v); } int get(int i) { int ans = 0; for (; i <= (int)comp.size(); i += i & -i) ckmax(ans, bit[i]); return ans; } // // int st[MAXN * 4]; // // void upd(int id, int l, int r, int p, int val) { // if (p < l || r < p) return; // if (l == r) { // ckmax(st[id], val); // return; // } // int mid = (l + r) >> 1; // upd(id << 1, l, mid, p, val); // upd(id << 1 | 1, mid + 1, r, p, val); // st[id] = max(st[id << 1], st[id << 1 | 1]); // } // // int get(int id, int l, int r, int u, int v) { // if (v < l || r < u) return 0; // if (u <= l && r <= v) return st[id]; // int mid = (l + r) >> 1; // return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v)); // } void solve() { for (int i = 1; i <= n; i++) { comp.emplace_back(e[i].fi); comp.emplace_back(e[i].se); } sort(comp.begin(), comp.end()); comp.resize(unique(comp.begin(), comp.end()) - comp.begin()); for (int i = 1; i <= n; i++) { e[i].fi = lower_bound(comp.begin(), comp.end(), e[i].fi) - comp.begin() + 1; e[i].se = lower_bound(comp.begin(), comp.end(), e[i].se) - comp.begin() + 1; } for (int i = n; i >= 1; i--) { dp[i] = get(e[i].se) + 1; add(e[i].fi, dp[i]); } // for (int i = 1; i <= n; i++) { // upd(1, 1, comp.size(), e[i].fi, dp[i]); // } vector<int> ans; for (int i = 1; i <= n; i++) { if (get(e[i].se) >= k - (int)ans.size() - 1) ans.emplace_back(i); if ((int)ans.size() == k) break; } if (ans.size() < k) cout << -1 << '\n'; else for (int x : ans) cout << x << '\n'; } } int main() { #define NAME "test" if (fopen(NAME".inp", "r")) { freopen(NAME".inp", "r", stdin); freopen(NAME".out", "w", stdout); } ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> k; bool checkSub1 = 1; for (int i = 1; i <= n; i++) { cin >> e[i].fi >> e[i].se; debug(e[i].fi, e[i - 1].fi, e[i].fi < e[i - 1].fi); if (i > 1 && e[i].fi < e[i - 1].fi) checkSub1 = 0; } if (checkSub1) sub1::solve(); return 0; }

event2.cpp: In function 'int main()':
event2.cpp:88:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         freopen(NAME".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
event2.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen(NAME".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~