131
272 428
185 936
3 288
271 549
707 958
362 614
128 778
512 570
233 880
68 475
517 986
<1061 bytes omitted>用户输出
1Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #80243 | #1021. jwp的区间游戏 | Wrong Answer | 0 | 812 ms | 14420 K | C++ 17 / 582 B | BenChak | 2022-07-16 17:51:45 |
#include <stdio.h>
#include <queue>
#include <algorithm>
using namespace std;
bool flag[1000005];
priority_queue<int> a;
priority_queue<int> b;
long long int n, ans, p = -1, c[1000005], d;
int main() {
scanf("%lld", &n);
for (int i = 1; i <= n; ++i) {
scanf("%lld%lld", &c[i], &d);
a.push(c[i]);
b.push(d);
}
sort(c + 1, c + n + 1);
for (int i = 1; i <= n; ++i) {
if (p <= a.top() && flag[i] == 0) {
for (int j = 1; j <= n; ++j) {
if (flag[j] == 0 && b.top() >= c[i])
flag[j] = 1;
}
p = b.top();
ans++;
}
a.pop();
b.pop();
}
printf("%lld", ans);
return 0;
}131
272 428
185 936
3 288
271 549
707 958
362 614
128 778
512 570
233 880
68 475
517 986
<1061 bytes omitted>用户输出
1Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 043
27 52
40 72
16 58
45 77
74 99
17 18
39 64
30 94
2 88
14 93
85 86
6 28
86 93
29 45
<200 bytes omitted>用户输出
1Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 047669
17877 19471
11395 15218
2902 18871
26938 27448
7762 11681
34 8895
19658 23096
1358 229
<587181 bytes omitted>用户输出
1Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0706251
8804 16040
19927 24477
13287 18478
28138 29487
6264 25954
5313 29464
13205 16993
1231
<8702005 bytes omitted>用户输出
1Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0