Submission #2038553

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n,m;
string s[55];

int main(){
	cin >> n >> m;
	REP(i,0,n){
		int x; cin >> x >> s[i];
		if(x>m){cout << s[max(0,i-1)] << endl; return 0;}
	}	
	
	cout << s[n-1] << endl;
	return 0;
}
             

Submission Info

Judge Result