#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
vector<ll> b(n);
vector<pair<ll,ll>> a(n+1);
for(int i=0;i<=n;i++) cin>>a[i].first;
for(int i=0;i<n;i++) cin>>b[i];
sort(b.begin(),b.end());
for(int i=0;i<=n;i++) a[i].second=i;
sort(a.begin(),a.end());
vector<ll> ans(n+1);
multiset<ll> s;
for(int i=0;i<n;i++) s.insert(a[i+1].first-b[i]);
ans[a[0].second]=*prev(s.end());
for(int i=1;i<=n;i++){
s.erase(s.find(a[i].first-b[i-1]));
s.insert(a[i-1].first-b[i-1]);
ans[a[i].second]=*prev(s.end());
}
for(auto x:ans) cout<<x<<" ";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
304 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 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 |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
304 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 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 |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
2 ms |
340 KB |
Output is correct |
15 |
Correct |
2 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
300 KB |
Output is correct |
17 |
Correct |
3 ms |
468 KB |
Output is correct |
18 |
Correct |
3 ms |
372 KB |
Output is correct |
19 |
Correct |
2 ms |
468 KB |
Output is correct |
20 |
Correct |
3 ms |
368 KB |
Output is correct |
21 |
Correct |
2 ms |
468 KB |
Output is correct |
22 |
Correct |
2 ms |
468 KB |
Output is correct |
23 |
Correct |
2 ms |
340 KB |
Output is correct |
24 |
Correct |
3 ms |
444 KB |
Output is correct |
25 |
Correct |
3 ms |
468 KB |
Output is correct |
26 |
Correct |
3 ms |
468 KB |
Output is correct |
27 |
Correct |
2 ms |
468 KB |
Output is correct |
28 |
Correct |
2 ms |
468 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
2 ms |
372 KB |
Output is correct |
31 |
Correct |
3 ms |
368 KB |
Output is correct |
32 |
Correct |
3 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
304 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 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 |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
2 ms |
340 KB |
Output is correct |
15 |
Correct |
2 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
300 KB |
Output is correct |
17 |
Correct |
3 ms |
468 KB |
Output is correct |
18 |
Correct |
3 ms |
372 KB |
Output is correct |
19 |
Correct |
2 ms |
468 KB |
Output is correct |
20 |
Correct |
3 ms |
368 KB |
Output is correct |
21 |
Correct |
2 ms |
468 KB |
Output is correct |
22 |
Correct |
2 ms |
468 KB |
Output is correct |
23 |
Correct |
2 ms |
340 KB |
Output is correct |
24 |
Correct |
3 ms |
444 KB |
Output is correct |
25 |
Correct |
3 ms |
468 KB |
Output is correct |
26 |
Correct |
3 ms |
468 KB |
Output is correct |
27 |
Correct |
2 ms |
468 KB |
Output is correct |
28 |
Correct |
2 ms |
468 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
2 ms |
372 KB |
Output is correct |
31 |
Correct |
3 ms |
368 KB |
Output is correct |
32 |
Correct |
3 ms |
468 KB |
Output is correct |
33 |
Correct |
283 ms |
20364 KB |
Output is correct |
34 |
Correct |
284 ms |
21196 KB |
Output is correct |
35 |
Correct |
272 ms |
20512 KB |
Output is correct |
36 |
Correct |
276 ms |
21108 KB |
Output is correct |
37 |
Correct |
279 ms |
21736 KB |
Output is correct |
38 |
Correct |
283 ms |
21452 KB |
Output is correct |
39 |
Correct |
325 ms |
20320 KB |
Output is correct |
40 |
Correct |
328 ms |
20348 KB |
Output is correct |
41 |
Correct |
369 ms |
20688 KB |
Output is correct |
42 |
Correct |
326 ms |
20604 KB |
Output is correct |
43 |
Correct |
324 ms |
20500 KB |
Output is correct |
44 |
Correct |
265 ms |
19740 KB |
Output is correct |
45 |
Correct |
262 ms |
19896 KB |
Output is correct |
46 |
Correct |
273 ms |
19896 KB |
Output is correct |
47 |
Correct |
256 ms |
20336 KB |
Output is correct |
48 |
Correct |
265 ms |
20384 KB |
Output is correct |
49 |
Correct |
441 ms |
20972 KB |
Output is correct |
50 |
Correct |
343 ms |
20976 KB |
Output is correct |
51 |
Correct |
342 ms |
20976 KB |
Output is correct |
52 |
Correct |
362 ms |
20976 KB |
Output is correct |
53 |
Correct |
352 ms |
20968 KB |
Output is correct |