玉桂狗玩偶：寻找最可爱的玩偶

#include "iostream"\n#include "algorithm"\nusing namespace std;\n\nint main() {\n int n, R;\n cin >> n >> R;\n \n int max_cuteness = 0;\n for (int i = 0; i < n; i++) {\n int k, p;\n cin >> k >> p;\n if (p <= R) {\n max_cuteness = max(max_cuteness, k);\n }\n }\n \n cout << max_cuteness << endl;\n \n return 0;\n}