#include<bits/stdc++.h>
#define fn(n) for(int i=1; i<=n; i++)
#define v first
#define s second
using namespace std;
using ll=long long;
int n;
pair<int, int> a[200002];
int c[200002];
int res[200002];
void nhap(){
cin >> n;
for(int i=1; i<=n+1; i++){
cin >> a[i].v;
a[i].s=i;
}
fn(n) cin >> c[i];
sort(a+1, a+n+2);
sort(c+1, c+n+1);
}
void solve(){
for(int i=1; i<=n+1; i++){
int l=0, r=0;
while(l <= n && r < n){
++l;
if(l==i) ++l;
++r;
if(a[l].v>c[r]) res[a[i].s]=max(res[a[i].s], a[l].v-c[r]);
}
}
for (int i=1; i<=n+1; i++) cout << res[i] << ' ';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
nhap();
solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
288 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
288 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
340 KB |
Output is correct |
14 |
Correct |
2 ms |
360 KB |
Output is correct |
15 |
Correct |
7 ms |
360 KB |
Output is correct |
16 |
Correct |
0 ms |
340 KB |
Output is correct |
17 |
Correct |
9 ms |
340 KB |
Output is correct |
18 |
Correct |
8 ms |
340 KB |
Output is correct |
19 |
Correct |
9 ms |
364 KB |
Output is correct |
20 |
Correct |
8 ms |
340 KB |
Output is correct |
21 |
Correct |
9 ms |
368 KB |
Output is correct |
22 |
Correct |
9 ms |
356 KB |
Output is correct |
23 |
Correct |
7 ms |
340 KB |
Output is correct |
24 |
Correct |
7 ms |
364 KB |
Output is correct |
25 |
Correct |
10 ms |
340 KB |
Output is correct |
26 |
Correct |
9 ms |
364 KB |
Output is correct |
27 |
Correct |
9 ms |
368 KB |
Output is correct |
28 |
Correct |
9 ms |
340 KB |
Output is correct |
29 |
Correct |
7 ms |
356 KB |
Output is correct |
30 |
Correct |
8 ms |
340 KB |
Output is correct |
31 |
Correct |
12 ms |
468 KB |
Output is correct |
32 |
Correct |
10 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
288 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
340 KB |
Output is correct |
14 |
Correct |
2 ms |
360 KB |
Output is correct |
15 |
Correct |
7 ms |
360 KB |
Output is correct |
16 |
Correct |
0 ms |
340 KB |
Output is correct |
17 |
Correct |
9 ms |
340 KB |
Output is correct |
18 |
Correct |
8 ms |
340 KB |
Output is correct |
19 |
Correct |
9 ms |
364 KB |
Output is correct |
20 |
Correct |
8 ms |
340 KB |
Output is correct |
21 |
Correct |
9 ms |
368 KB |
Output is correct |
22 |
Correct |
9 ms |
356 KB |
Output is correct |
23 |
Correct |
7 ms |
340 KB |
Output is correct |
24 |
Correct |
7 ms |
364 KB |
Output is correct |
25 |
Correct |
10 ms |
340 KB |
Output is correct |
26 |
Correct |
9 ms |
364 KB |
Output is correct |
27 |
Correct |
9 ms |
368 KB |
Output is correct |
28 |
Correct |
9 ms |
340 KB |
Output is correct |
29 |
Correct |
7 ms |
356 KB |
Output is correct |
30 |
Correct |
8 ms |
340 KB |
Output is correct |
31 |
Correct |
12 ms |
468 KB |
Output is correct |
32 |
Correct |
10 ms |
364 KB |
Output is correct |
33 |
Execution timed out |
1066 ms |
3284 KB |
Time limit exceeded |
34 |
Halted |
0 ms |
0 KB |
- |