-
Notifications
You must be signed in to change notification settings - Fork 37
/
chefinaSwaps_julyLongChallenge2020.cpp
145 lines (144 loc) · 3.9 KB
/
chefinaSwaps_julyLongChallenge2020.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
// Chefina and swaps July Long challenge 2020.
#include <bits/stdc++.h>
using namespace std;
#define pairii pair<int, int>
#define veci vector<int>
#define vecl vector<ll>
#define mapii map<int, int>
#define umapll unordered_map<ll, ll>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define set unordered_set
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define setbits(x) __builtin_popcountll(x)
#define leadzero(x) __builtin_clzll(x)
#define trailzero(x) __builtin_ctzll(x)
#define parity(x) _builtin_parityll(x)
#define mod 1000000007
#define inf 1e18
#define bitscount 32
#define pi 3.141592653589793
#define gold 1.618033988749895
#define maxInt INT_MAX
#define minInt INT_MIN
#define ps(x, y) fixed << setprecision(y) << x
#define mkarr(arr, n, type) type *arr = new type[n];
#define pw(b, p) pow(b, p) + 0.1
#define fastio \
ios_base::sync_with_stdio(NULL); \
cin.tie(NULL); \
cout.tie(NULL);
#define t() \
int t; \
cin >> t; \
while (t--)
#define read(x) scanf("%d", &x)
#define write(x) printf("%d\n", x)
#define loop(i, n) for (int i = 0; i < n; i++)
#define looplong(i, n) for (ll i = 0; i < n; i++)
#define loopab(i, a, b) for (int i = a; i < b; i++)
#define looplongab(i, a, b) for (ll i = a; i < b; i++)
#define looplongnminusone(i, n) for (ll i = 0; i < n - 1; i++)
#define loopba(i, a, b) for (int i = a; i >= b; i--)
#define looplongba(i, a, b) for (ll i = a; i >= b; i--)
#define foreach(name) for (auto i = name.begin(); i != name.end(); i++)
#define endln "\n"
#define hcf(a, b) __gcd(a, b)
#define lcm(a, b) ((a * b)) / (__gcd(a, b))
#define init(c, bytes) memset(c, 0, (bytes)) //c=container
#define initc(c, bytes) memset(c, '0', (bytes))
#define max(a, b) (a) > (b) ? (a) : (b)
#define min(a, b) (a) < (b) ? (a) : (b)
#define mid(start, end) (((end) - (start)) >> 1) + (start)
#define pointloop for (ll i = 0; i < (4 * n) - 1; i++)
typedef long long ll;
typedef unsigned long long ull;
int32_t main()
{
fastio
t()
{
ll n;
cin >> n;
ll arr1[n], arr2[n];
umapll mp, map1, map2;
ll minimum = LLONG_MAX;
loop(i,n)
{
cin >> arr1[i];
minimum = min(arr1[i], minimum);
mp[arr1[i]]++;
}
loop(i,n)
{
cin >> arr2[i];
minimum = min(arr2[i], minimum);
mp[arr2[i]]++;
}
ll flag = 0;
for (auto iteerator : mp)
{
if (iteerator.second % 2 == 1)
{
flag = 1;
break;
}
else
{
map1[iteerator.first] = iteerator.second / 2;
}
}
if (flag)
{
cout << "-1"<<endln;
continue;
}
else
{
map2 = map1;
vecl ans1, ans2;
loop(i, n)
{
if (map1[arr1[i]])
{
map1[arr1[i]]--;
}
else
{
ans1.push_back(arr1[i]);
}
}
loop(i, n)
{
if (map2[arr2[i]])
{
map2[arr2[i]]--;
}
else
{
ans2.push_back(arr2[i]);
}
}
sort(ans1.begin(), ans1.end());
sort(ans2.begin(), ans2.end(), greater<ll>());
ll y = ans1.size();
if (y == 0)
{
cout << "0"<<endln;
}
else
{
ll ans = 0;
for (int i = 0; i < y; i++)
{
ans += min(2 * minimum, min(ans1[i], ans2[i]));
}
cout << ans << endln;
}
}
}
return 0;
}