PROBLEM LINK:
Practice
Contest: Division 1
Contest: Division 2
Contest: Division 3
Contest: Division 4
Author: Kanhaiya Mohan
Testers: Takuki Kurokawa, Utkarsh Gupta
Editorialist: Nishank Suresh
DIFFICULTY:
364
PREREQUISITES:
None
PROBLEM:
Sorting algorithm A uses X comparisons and B uses Y comparisons to sort an array. Does A have more time complexity?
EXPLANATION:
According to the statement, the answer is “Yes” if X \gt Y and “No” otherwise.
This can be checked using an if condition.
TIME COMPLEXITY
\mathcal{O}(1) per test case.
CODE:
Editorialist's code (Python)
for _ in range(int(input())):
x, y = map(int, input().split())
print('Yes' if x > y else 'No')