Submission #3361403

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

int main() {
    int N, T; cin >> N >> T;
    int best = INT_MAX;
    rep(i,N){
        int ci,ti; cin >> ci >> ti;
        if (ti <= T) best = min(best, ci);
    }
    if (best == INT_MAX) {
        cout << "TLE" << endl;
    } else {
        cout << best << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task B - Time Limit Exceeded
User naoya_t
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1519 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
All 200 / 200 hand_1, sample_01, sample_02, sample_03, testcase_1, testcase_2, testcase_3, testcase_4, testcase_5, testcase_6, testcase_7, testcase_8, testcase_9
Sample 0 / 0 sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
hand_1 1 ms 256 KB
sample_01 1 ms 256 KB
sample_02 1 ms 256 KB
sample_03 1 ms 256 KB
testcase_1 1 ms 256 KB
testcase_2 1 ms 256 KB
testcase_3 1 ms 256 KB
testcase_4 1 ms 256 KB
testcase_5 1 ms 256 KB
testcase_6 1 ms 256 KB
testcase_7 1 ms 256 KB
testcase_8 1 ms 256 KB
testcase_9 1 ms 256 KB