FlandreScarle7/Codeforces-SolutionsA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

added 1921D

Browse Source
This commit is contained in:
ShazidMahsrafi 2024-01-16 23:04:28 +06:00
parent 49f80be6e9
commit 98e0db0799
2 changed files with 96 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

94
Codes/1921 D - Very Different Array/1921D.cpp Normal file
View File

@ -0,0 +1,94 @@
#include<bits/stdc++.h>
using namespace std;
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define int long long
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define neg1 cout<<-1<<endl
#define PI 3.141592653589793238
#define MIN INT_MIN
#define MAX INT_MAX
#define INF LONG_LONG_MAX
#define MOD 1000000007
#define LLM 1000000000000000007
ll factorial(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
ll nPr(ll n, ll r) { return factorial(n) / factorial(n - r); }
ll nCr(ll n, ll r) { return factorial(n) / (factorial(r) * factorial(n - r));}
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
ull mypow(ull a, ull b) { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
#else
#define dbg(x)
#define dbgin(x)
#endif
void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
void solve()
{
int n,m;
cin>>n>>m;
vector<int>a(n),b(m);
for(int &i:a) cin>>i;
for(int &i:b) cin>>i;
sort(all(a));
sort(all(b));
int ans=0;
int la=0,ra=n-1,lb=0,rb=m-1;
while(la<=ra)
{
int l=abs(a[la]-b[rb]);
int r=abs(a[ra]-b[lb]);
if(l>=r)
{
ans += l;
la++,rb--;
}
else
{
ans += r;
ra--, lb++;
}
}
cout<<ans<<endl;
}
int32_t main()
{
FAST_IO;
int TC = 1;
cin >> TC;
while (TC--)
solve();
}

3
Readme.md
View File

@ -243,7 +243,8 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
| 231 | 1921 A | Square | [Question](https://codeforces.com/problemset/problem/1921/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20A%20-%20Square)
| 232 | 1921 B | Arranging Cats | [Question](https://codeforces.com/problemset/problem/1921/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20B%20-%20Arranging%20Cats)
| 233 | 1921 C | Sending Messages | [Question](https://codeforces.com/problemset/problem/1921/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20C%20-%20Sending%20Messages)
| 234 | 19020 B | Summation Game | [Question](https://codeforces.com/problemset/problem/19020/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/19020%20B%20-%20Summation%20Game)
| 234 | 1921 D | Very Different Array | [Question](https://codeforces.com/problemset/problem/1921/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20D%20-%20Very%20Different%20Array)
| 235 | 19020 B | Summation Game | [Question](https://codeforces.com/problemset/problem/19020/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/19020%20B%20-%20Summation%20Game)