删除第13行 sort(k, k+n) 代码运行结果不变。

cpp
复制
1#include <bits/stdc++.h>
2using namespace std;
3const int N = 1e5+10;
4long long k[N];
cpp
复制
1int main() {,[object Object],
2int n, m;,[object Object],
3scanf("%d %d", &n, &m);,[object Object],
4for (int i = 0; i < n; i++) {,[object Object],
5scanf("%lld", &k[i]);,[object Object],
6},[object Object],
7sort(k, k+n);,[object Object],
8while (m--) {,[object Object],
9long long a, b, c;,[object Object],
10scanf("%lld %lld %lld", &a, &b, &c);,[object Object],
11if (c <= 0) {,[object Object],
12printf("NO\n");,[object Object],
13continue;,[object Object],
14},[object Object],
15int pos1 = lower_bound(k, k+n, b) - k;,[object Object],
16int pos2 = pos1;,[object Object],
17if (pos1 != 0) {,[object Object],
18pos2 = pos1 - 1;,[object Object],
19},[object Object],
20if (pos1 != n && (b-k[pos1]),[object Object],a,[object Object],(b-k[pos2]) < 4,[object Object],c) {,[object Object],
21printf("YES\n%lld\n", k[pos2]);,[object Object],
22} else {,[object Object],
23printf("NO\n");,[object Object],
24},[object Object],
25},[object Object],
26return 0;,[object Object],
27},[object Object],