Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int N = 5e5 + 10;
- using lli = long long;
- lli A[N], B[N], ar[N];
- int main(){
- int n;
- scanf("%d", &n);
- for(int i=1;i<=n;i++) scanf("%lld", &A[i]);
- for(int i=1;i<=n;i++) scanf("%lld", &B[i]);
- sort(A + 1, A + n + 1);
- sort(B + 1, B + n + 1);
- for(int i=1;i<=n;i++){
- int j = n-i+1;
- ar[i] = A[i] + B[j];
- }
- lli sum = 0;
- sort(ar + 1, ar + n + 1);
- for(int i=2;i<=n;i++){
- sum += ar[i] - ar[i-1];
- }
- printf("%lld", sum);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement