-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathAquaMoon_And_Two_Arrays.cpp
More file actions
72 lines (66 loc) · 1.74 KB
/
AquaMoon_And_Two_Arrays.cpp
File metadata and controls
72 lines (66 loc) · 1.74 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int a[n], b[n], c[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
int diff=0,r=0;
for(int i=0;i<n;i++)
diff+=a[i]-b[i] , r+=abs(a[i]-b[i]) , c[i]= a[i]-b[i];
if(diff!=0)
cout<<-1<<endl;
else
{
int sz=r/2 , u=0;
vector<pair<int,int>> vec;
for(int i=0;i<n;i++)
{
if(c[i]>0)
{
for(int j=i+1;j<n;j++)
{
if(c[j]<0)
{
while(c[j]<0 && c[i]>0)
{
vec.push_back(make_pair(i+1 , j+1));
c[i]=c[i]-1;
c[j]=c[j]+1;
u++;
}
}
}
}
else if(c[i]<0)
{
for(int j=i+1;j<n;j++)
{
if(c[j]>0)
{
while(c[i]<0 && c[j]>0)
{
vec.push_back(make_pair(j+1 , i+1));
c[i]=c[i]+1;
c[j]=c[j]-1;
u++;
}
}
}
}
}
cout<<sz<<endl;
for(int i=0;i<sz;i++)
cout<<vec[i].first<<" "<< vec[i].second<<endl;
}
}
return 0;
}