Problem: 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.

Submission attempts (in order):
import numpy as np
N, T = map(int, input().split())

li = list(map(int, input().split())) for i in range(N)
        
li2 = list(li for t in li[,1] <= T)
      minli = min(li2[0,])
      
print(minli)

N, T = map(int, input().split())
li = []
try:
  li = [list(map(int, input().split())) for i in range(N)]
except EOFError:
  pass

li2 = [] 

for s in li:
  if s[0:] <= T:
    li2 = li2.append(s)
    for t in li2:
      minli = min(li2[:1])
      print(minli)
      
  else:
    print("TLE")


#include<algorithm>


using namespace std;

int main(){
  int N, T; cin >> N >> T;
  vector<int> c[i], t[i];
  for(int i = 0, i < N; ++i) {
    cin >> c[i] >> t[i];
  }
  int MAX = 1 << 30;
  int ans = MAX;

  for (int i = 0; i < N; ++i){
    if(t[i] <= T){
      ans = min(ans, c[i]);
      
    }
  }

  if (ans <  MAX){
    cout << ans << endl;
  }
  else {
    cout << "TLE" << endl;
  }
}


#include<algorithm>


using namespace std;

int main(){
  int N, T; cin >> N >> T;
  vector<int> c[N], t[N];
  for(int i = 0, i < N; ++i) {
    cin >> c[i] >> t[i];
  }
  int MAX = 1 << 30;
  int ans = MAX;

  for (int i = 0; i < N; ++i){
    if(t[i] <= T){
      ans = min(ans, c[i]);
      
    }
  }

  if (ans <  MAX){
    cout << ans << endl;
  }
  else {
    cout << "TLE" << endl;
  }
}

import numpy as np
N, T = map(int, input().split())

li = [list(map(int, input().split())) for i in range(N)
        
li2 = list[li for t in li[,1] <= T]
      minli = min(li2[0,])
      
print(minli)

N, T = map(int, input().split())
li = [list(map(int, input().split())) for i in range(N)]
li2 = [] 

for s in li:
  if s[0:] <= T:
    li2 = li2.append(s)
    for t in li2:
      minli = min(li2[:1])
      print(minli)
      
  else:
    print("TLE")


#include<algorithm>


using namespace std;

int main(){
  int N, T; 
  cin >> N >> T;
  vector<int> c[N]
  vector<int> t[N];
  for(int i = 0; i < N; ++i) {
    cin >> c[i] >> t[i];
  }
  int MAX = 1 << 30;
  int ans = MAX;

  for (int i = 0; i < N; ++i){
    if(t[i] <= T){
      ans = min(ans, c[i]);
      
    }
  }

  if (ans <  MAX){
    cout << ans << endl;
  }
  else {
    cout << "TLE" << endl;
  }
}

import numpy as np
N, T = map(int, input().split()) 

li = list(map(int, input().split())) for i in range(N)　、二次元リスト完成
li2 = []

for s in li:
  if s[0:] <= T:
    li2 = li2.append(s)　　　　

for t in li2:
  minli = min(li2[[:1]])

print(minli)


#include<algorithm>


using namespace std;

int main(){
  int N, T; 
  cin >> N >> T;
  vector<int> c[N], t[N];
  for(int i = 0, i < N; ++i) {
    cin >> c[i] >> t[i];
  }
  int MAX = 1 << 30;
  int ans = MAX;

  for (int i = 0; i < N; ++i){
    if(t[i] <= T){
      ans = min(ans, c[i]);
      
    }
  }

  if (ans <  MAX){
    cout << ans << endl;
  }
  else {
    cout << "TLE" << endl;
  }
}

N, T = map(int, input().split())
data = [list(map(int, input().split())) for i in range(N)
        
l = list[s for s in data if data.split([:1]) <= T
     
minl = t for t in min(l.split([0:])
      
print(minl)

N, T = map(int, input().split())
li = [list(map(int, input().split())) for i in range(N)]
li2 = []

if 


for s in li:
  if s[0:] <= T:
    li2 = li2.append(s)
    for t in li2:
      minli = min(li2[:1])
      print(minli)
      
  else:
    print("TLE")

N,T = map(int,input().split())
ans = 1001
for i in range(N):
    c,t = map(int,input().split())
    if t <= T:
        ans = min(ans,c)
if ans == 1001:
    print('TLE')
else:
    print(ans)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted