CodeForces Round #661 div3

A.
ac 46ms

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#include<cmath>

using namespace std;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        map<int,int> mp;
        for(int i=1;i<=n;i++){
            int x;
            cin>>x;
            mp[x]=1;
        }
        map<int,int>::iterator it=mp.begin();
        int a1=it->first,b1=it->second;
        for(it++;it!=mp.end();it++){
            int a2=it->first,b2=it->second;
            if(abs(a1-a2)<=1)mp.erase(a1);
            a1=a2,b1=b2;
        }
        if(mp.size()>1)cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
    return 0;
}

B.
ac 46ms

#pragma GCC optimize("Ofast")
#include<iostream>
#include<cstring>
#include<algorithm>
#define INF 0x3f3f3f3f

using namespace std;

typedef long long ll;
const int N=60;
int a[N],b[N];

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        int minv=INF,minw=INF;
        for(int i=0;i<n;i++){
            cin>>a[i];
            minv=min(minv,a[i]);
        }
        for(int i=0;i<n;i++){
            cin>>b[i];
            minw=min(minw,b[i]);
        }
        ll ans=0;
        for(int i=0;i<n;i++){
            int a1=a[i]-minv;
            int b1=b[i]-minw;
            ans+=max(a1,b1);
        }
        cout<<ans<<endl;
    }
    return 0;
}