Submission #2797819

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
int main() {
	int n, q;
	cin >> n >> q;
	pair<int, string>a[55];
	a[0].first = 0;
	a[0].second = "kogakubu10gokan";
	for (int i = 1; i <= n; i++) {
		cin >> a[i].first >> a[i].second;
		if (a[i].first == q) {
			cout << a[i].second << endl;
			break;
		}
		else if (a[i].first > q) {
			cout << a[i - 1].second << endl;
			break;
		}
	}
	return 0;
}

Submission Info

Judge Result