牛牛找工作

package com.company;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;


public class Main {
    static class Job implements Comparable<Job>{
        int dif;
        int money;
        public Job(int dif,int money){
            this.dif = dif;
            this.money = money;
        }

        @Override
        public int compareTo(Job job) {
            return this.dif-job.dif;
        }
    }

    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(System.in);
        int jobN = scanner.nextInt();
        int friN = scanner.nextInt();
        Job[] jobs = new Job[jobN];
        int[] friends = new int[friN];
        for(int i=0;i<jobN;i++){
            jobs[i] = new Job(scanner.nextInt(),scanner.nextInt());
        }

        Comparator c =  new Comparator<Job>() {
            @Override
            public int compare(Job job, Job t1) {
                return job.dif-t1.dif;
            }
        };
        //dp[i]表示 难度在索引i之前的Job的最大薪酬
        Arrays.sort(jobs,c);
        int[] dp = new  int[jobN];
        int maxM = -1;
        for(int i=0;i<jobN;i++){
            maxM = Math.max(maxM,jobs[i].money);
            dp[i] = maxM;
        }

        TreeMap<Integer,Integer> treeMap = new TreeMap<>();
        for(int i=0;i<jobN;i++){
            treeMap.put(jobs[i].dif,dp[i]);
        }
        for(int i=0;i<friN;i++){
            Integer key = treeMap.floorKey(scanner.nextInt());
            System.out.println(treeMap.get(key));
        }
    }
}