439D - Devu and his Brother - CodeForces Solution


binary search sortings ternary search two pointers *1700

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
#define lng long long int
using namespace std;


int main(){
    
    lng n,m;
    cin>>n>>m;
    
    int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int b[m];
    for(int i=0;i<m;i++){
        cin>>b[i];
    }
    
     
     sort(a,a+n);
     sort(b,b+m,greater<int>());
     
     lng cnt=0;
     for(int i=0;i<min(n,m)&&a[i]<b[i];i++){
         cnt+=abs(a[i]-b[i]);
     }
    
    cout<<cnt<<endl;
    
    return 0;
}


Comments

Submit
0 Comments
More Questions

1711A - Perfect Permutation
1701B - Permutation
1692A - Marathon
1066A - Vova and Train
169B - Replacing Digits
171D - Broken checker
380C - Sereja and Brackets
1281B - Azamon Web Services
1702A - Round Down the Price
1681C - Double Sort
12A - Super Agent
1709A - Three Doors
1680C - Binary String
1684B - Z mod X = C
1003A - Polycarp's Pockets
1691B - Shoe Shuffling
1706A - Another String Minimization Problem
1695B - Circle Game
1702B - Polycarp Writes a String from Memory
1701A - Grass Field
489C - Given Length and Sum of Digits
886B - Vlad and Cafes
915A - Garden
356A - Knight Tournament
1330A - Dreamoon and Ranking Collection
1692B - All Distinct
1156C - Match Points
1675A - Food for Animals
1328C - Ternary XOR
1689A - Lex String