1918B - Minimize Inversions - CodeForces Solution


constructive algorithms data structures implementation sortings

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    n = int(input()) 
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    m = sorted(zip(a, b)) 
    print(*[i[0] for i in m])
    print(*[i[1] for i in m]) 

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main(){
    int t;cin>>t;while(t--){
       long long int n;cin>>n;
       int a[n],b[n];
       for(int i=0;i<n;i++){
           cin>>a[i];
       }
       for(int i=0;i<n;i++){
           cin>>b[i];
       }
       vector<pair<int,int>> p;
       for(int i=0;i<n;i++){
           p.push_back ({a[i],b[i]});
       }
       sort(p.begin(),p.end());
       for(int i=0;i<n;i++){
           cout<<p[i].first<<" ";
       }
       cout<<endl;
       for(int i=0;i<n;i++){
           cout<<p[i].second<<" ";
       }
       cout<<endl;
    }
}


Comments

Submit
0 Comments
More Questions

1496A - Split it
1666L - Labyrinth
1294B - Collecting Packages
1642B - Power Walking
1424M - Ancient Language
600C - Make Palindrome
1669D - Colorful Stamp
1669B - Triple
1669A - Division
1669H - Maximal AND
1669E - 2-Letter Strings
483A - Counterexample
3C - Tic-tac-toe
1669F - Eating Candies
1323B - Count Subrectangles
991C - Candies
1463A - Dungeon
1671D - Insert a Progression
1671A - String Building
1671B - Consecutive Points Segment
1671C - Dolce Vita
1669G - Fall Down
4D - Mysterious Present
1316B - String Modification
1204A - BowWow and the Timetable
508B - Anton and currency you all know
1672A - Log Chopping
300A - Array
48D - Permutations
677C - Vanya and Label