在楼主的基础上把牛牛找工作的代码优化一下 #include <bits/stdc++.h> using namespace std; map<int, int> mp; int cnt = 0; int ans[200005]; int d[100005], p[100005]; int val[200005]; int a[100005]; int main() { int maxn = 0; int n, m; scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) { scanf("%d%d", &d[i], &p[i]); mp[d[i]] = p[i]; } for (int i = 1; i <= m; i++) { scanf("%d", &a[i]); } for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) { if (mp[it->first] >= maxn) { maxn = mp[it->first]; } else { mp[it->first] = maxn; } } for (int i = 1; i <= m; i++) { map<int, int>::iterator it1 = mp.upper_bound(a[i]); --it1; cout << mp[it1->first] << endl; } return 0; }