-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaquamoon.cpp
More file actions
58 lines (58 loc) · 1.11 KB
/
Copy pathaquamoon.cpp
File metadata and controls
58 lines (58 loc) · 1.11 KB
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
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve()
{
int n;
cin >> n;
int a[n], b[n];
int sum = 0, sum_a = 0, sum_b = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum_a = sum_a + a[i];
}
for (int i = 0; i < n; i++)
{
cin >> b[i];
sum_b = sum_b + b[i];
sum = sum + abs(a[i] - b[i]);
}
if (sum_a != sum_b)
{
cout << -1 << endl;
}
else
{
cout << sum / 2 << endl;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (a[i] > b[i] && a[j] < b[j])
{
a[i] = a[i] - 1;
a[j] = a[j] + 1;
cout << i + 1 << " " << j + 1 << endl;
j--;
}
}
}
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc;
cin >> tc;
for (int t = 1; t <= tc; t++)
{
solve();
}
}