感觉思路差不多 一直tle 求看 import java.util.*; public class Main { public static class custom implements Comparable<custom> { int num; int cash; public custom(int a, int b) { num = a; cash = b; } @Override public int compareTo(custom o) { return o.cash - this.cash; } } public static void main(String[] args) { Scanner s = new Scanner(System.in); int n = s.nextInt(); int m = s.nextInt(); int[] table = new int[n]; for (int i = 0; i < n; i++) { table[i] = s.nextInt(); } Arrays.sort(table); TreeMap<Integer, Queue<custom>> mmm = new TreeMap<>(); custom[] c = new custom[m]; for (int i = 0; i < m; i++) { c[i] = new custom(s.nextInt(), s.nextInt()); if (!mmm.containsKey(c[i].num)) { mmm.put(c[i].num, new PriorityQueue<>()); } mmm.get(c[i].num).add(c[i]); } long ans = 0; for (int i = 0; i < n; i++) { int max = 0; int index = -1; Map<Integer, Queue<custom>> tmpmap = mmm.subMap(0, table[i] + 1); Iterator<Map.Entry<Integer, Queue<custom>>> it = tmpmap.entrySet().iterator(); while (it.hasNext()) { Map.Entry<Integer, Queue<custom>> e = it.next(); if (e.getValue().peek().cash > max) { max = e.getValue().peek().cash; index = e.getKey(); } } ans += max; if (index != -1) { mmm.get(index).poll(); if (mmm.get(index).isEmpty()) { mmm.remove(index); } } } System.out.println(ans); } }