Time Limit Exceeded

AtCoder

IDabc112_b

Time2000ms

Memory256MB

Difficulty—

When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC. You, the smartwatch, has found $N$ routes to his home. If Mr. X uses the $i$\-th of these routes, he will get home in time $t_i$ at cost $c_i$. Find the smallest cost of a route that takes not longer than time $T$. ## Constraints * All values in input are integers. * $1 \leq N \leq 100$ * $1 \leq T \leq 1000$ * $1 \leq c_i \leq 1000$ * $1 \leq t_i \leq 1000$ * The pairs $(c_i, t_i)$ are distinct. ## Input Input is given from Standard Input in the following format: $N$ $T$ $c_1$ $t_1$ $c_2$ $t_2$ $:$ $c_N$ $t_N$ [samples]

Samples

Input #1

Output #1

4

*   The first route gets him home at cost $7$.
*   The second route takes longer than time $T = 70$.
*   The third route gets him home at cost $4$.

Thus, the cost $4$ of the third route is the minimum.

Input #2

Output #2

TLE

There is no route that takes not longer than time $T = 3$.

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Time Limit Exceeded",
    "description": {
      "content": "When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC. You, the smartwatch, has found $N$ routes to his home. If Mr. X uses",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc112_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\nYou, the smartwatch, has found $N$ routes to his home.\nIf Mr. X uses...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments