Submission #53606210

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main() {
  int N;
  cin >> N;
  map<pair<int, int>, int> M;
  for (int i = 0; i < N; i++) {
    int A, C;
    cin >> A >> C;
    M[{-A, C}] = i + 1;
  }

  vector<int> ans;
  int c_min = INT32_MAX;
  for (auto &&M_i : M) {
    if (M_i.first.second >= c_min) continue;
    ans.push_back(M_i.second);
    c_min = M_i.first.second;
  }
  sort(ans.begin(), ans.end());

  int m = ans.size();
  cout << m << endl;
  cout << ans[0];
  for (int i = 1; i < m; i++) {
    cout << " " << ans[i];
  }
  cout << endl;

  return 0;
}

Submission Info

Judge Result