提出 #73775294

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;

// --templates--
// -- 1.型系 --
using ll = long long;
const ll INF = 2e18;
using ld = long double;
using mint = modint998244353;
// using mint = modint1000000007;
using bl = bool;

// -------------

// -- 2.配列系 --
using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using vs = vc<string>; using vvs = vv<string>;
using vb = vc<bl>; using vvb = vv<bl>; using vvvb = vv<vb>;
using vld = vc<ld>; using vvld = vv<ld>; using vvvld = vv<vld>;
using pll = pair<ll, ll>;
using dql = deque<ll>; using dqpll = deque<pll>;
using mpl = map<ll, ll>; using mps = map<string, ll>; using mpv = map<ll, vl>;
using vmint = vc<mint>; using vvmint = vv<mint>; using vvvmint = vv<vmint>;
using pq = priority_queue<pll, vc<pll>, greater<pll>>;
// using pq = priority_queue<ll>;

// -------------

// -- 3.コードの簡略化 --
#define nl "\n"
#define rep(i, x, limit) for (ll i = (ll)x; i < ll(limit); i++)
#define drep(i, x, limit) for (ll i = (ll)x; i >= ll(limit); i--)

#define nall(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

#define pf push_front
#define pb push_back
#define pof pop_front
#define pob pop_back
#define emf emplace_front
#define emb emplace_back

#define Yes cout << "Yes" << nl
#define No cout << "No" << nl
#define YES cout << "YES" << nl
#define NO cout << "NO" << nl
#define YN {cout << "Yes" << nl;} else {cout << "No" << nl;}
#define ng cout << -1 << nl

#define pop_cnt(x) __builtin_popcountll(x)

#define next_p(v) next_permutation(v.begin(), v.end())

// -------------

// -- 4.グリッド --
// const vl dx = {-1, -1, -1, 0, 0, 1, 1, 1};
// const vl dy = {1, 0, -1, 1, -1, 1, 0, -1};
// const vl dx = {1, 0, -1, 0};
// const vl dy = {0, 1, 0, -1};

bl in_grid(ll i, ll j, ll h, ll w) { return (0 <= i && i < h && 0 <= j && j < w); }
bl out_grid(ll i, ll j, ll h, ll w) { return (!(0 <= i && i < h && 0 <= j && j < w)); }

// -------------

// -- 5.数学系 --
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b/gcd(a,b))

// -------------

// -- 6.出力系 --
void print(ld x) { printf("%.20Lf\n", x); }

#define vc_cout_n(v) {ll n = size(v); rep(i, 0, n) cout << v[i] << nl;}
#define vc_cout_s(v) {ll n = v.size();rep(i, 0, n) {cout << v[i] <<  " ";}cout << nl;}
#define vv_cout(v){ll n = size(v);rep(i,n){rep(j,size(v[i])){cout<<v[i][j]<<' ';}cout<<nl;}}

// -------------


int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  ll N, L, R, T; cin >> N >> L >> R >> T;
  ll good_p = INF, good_s = 0;
  ll ans = -1;
  rep(i, 0, N) {
    ll p, s; cin >> p >> s;
    if (L <= p && p <= R && s >= T) {
      if (p < good_p) {
        ans = i+1;
        good_p = p;
        good_s = s;
      }
      else if (p == good_p && s > good_s) {
        ans = i+1;
        good_s = s;
      }
    }
  }
  cout << ans << nl;
}

提出情報

ジャッジ結果