coderrohan14

Solution2Java

Sep 22nd, 2021
57
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.79 KB | None | 0 0
  1. import java.util.*;
  2.  
  3. public class Solution{
  4. public static void main(String[] args){
  5. Scanner sc = new Scanner(System.in);
  6. int t = sc.nextInt();
  7. StringBuilder ans = new StringBuilder("");
  8. while (t-- > 0) {
  9. int x=sc.nextInt(), y=sc.nextInt(), k=sc.nextInt(), n=sc.nextInt();
  10. int needed = x-y,max = 0;
  11. int[] w = new int[n], c = new int[n];
  12. for(int i=0;i<n;i++){
  13. w[i] = sc.nextInt();
  14. c[i] = sc.nextInt();
  15. if(c[i]<=k) max = Math.max(w[i],max);
  16. }
  17. if(needed<=max){
  18. ans.append("Fortunate\n");
  19. }else{
  20. ans.append("Unfortunate\n");
  21. }
  22. }
  23. System.out.println(ans);
  24. }
  25. }
Advertisement
Add Comment
Please, Sign In to add comment