#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=a;i<b;i++)
#define fore(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define F first
#define S second
#define INF ll(1e18)
#define MOD 998244353
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define MAXN 200005
ll a[MAXN],b[MAXN];
ll p1[MAXN],p2[MAXN];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin>>n;
forn(i,0,n+1) cin>>a[i];
forn(i,0,n) cin>>b[i];
sort(a,a+n+1);
sort(b,b+n);
forn(i,0,n){
p1[i]=max(0LL,a[i]-b[i]);
p2[i]=max(0LL,a[i+1]-b[i]);
}
forn(i,1,n) p1[i]=max(p1[i],p1[i-1]);
for(int i=n-2;i>=0;i--) p2[i]=max(p2[i],p2[i+1]);
cout<<p2[0]<<" ";
forn(i,0,n-1){
cout<<max(p1[i],p2[i+1])<<" ";
}
cout<<p1[n-1]<<'\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
