Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class Solution{
- public static void main(String[] args){
- Scanner sc = new Scanner(System.in);
- int t = sc.nextInt();
- StringBuilder ans = new StringBuilder("");
- while (t-- > 0) {
- int x=sc.nextInt(), y=sc.nextInt(), k=sc.nextInt(), n=sc.nextInt();
- int needed = x-y,max = 0;
- int[] w = new int[n], c = new int[n];
- for(int i=0;i<n;i++){
- w[i] = sc.nextInt();
- c[i] = sc.nextInt();
- if(c[i]<=k) max = Math.max(w[i],max);
- }
- if(needed<=max){
- ans.append("Fortunate\n");
- }else{
- ans.append("Unfortunate\n");
- }
- }
- System.out.println(ans);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment