D. Very Different Array

合集 - codeforces(57)

1.C. Insert and Equalize2023-12-06 2.C. Removal of Unattractive Pairs2023-12-06 3.D. Jumping Through Segments2023-12-08 4.E. Good Triples2023-12-08 5.F. Shift and Reverse2023-12-08 6.D. Yet Another Monster Fight2023-12-11 7.A. Constructive Problems2023-12-18 8.C. Game with Multiset2023-12-19 9.A. Rating Increase2023-12-19 10.B. Swap and Delete2023-12-19 11.A. Problemsolving Log2023-12-20 12.B. Preparing for the Contest2023-12-20 13.C. Quests2023-12-20 14.D. Three Activities2023-12-20 15.E2. Game with Marbles (Hard Version)2023-12-20 16.cf刷题有感2023-12-20 17.A. Anonymous Informant2023-12-21 18.A. Forked!2023-12-23 19.B. Make Almost Equal With Mod2023-12-27 20.C. Heavy Intervals2023-12-27 21.D. Split Plus K2023-12-28 22.A. 20232023-12-31 23.B. Two Divisors2023-12-31 24.C. Training Before the Olympiad2023-12-31 25.D. Mathematical Problem2024-01-02 26.F. Greetings2024-01-02 27.C. Partitioning the Array2024-01-15 28.G. Bicycles2024-01-16 29.E. Eat the Chip2024-01-17 30.G. Lights2024-01-17 31.D. Array Repetition2024-01-17 32.D. Berserk Monsters2024-01-22 33.E. Increasing Subsequences2024-01-23

34.D. Very Different Array2024-01-24

35.G. Mischievous Shooter2024-01-25 36.B. Plus-Minus Split2024-01-27 37.B. A Balanced Problemset2024-01-28 38.C. Did We Get Everything Covered2024-01-28 39.D. Find the Different Ones!2024-02-08 40.C. Grouping Increases2024-02-10 41.D. Good Trip2024-02-12 42.C. Physical Education Lesson2024-02-12 43.E. Final Countdown2024-02-18 44.D. Divisible Pairs2024-02-19 45.G. Vlad and Trouble at MIT2024-02-20 46.A. Brick Wall2024-02-28 47.B. Minimize Inversions2024-02-28 48.C. XOR-distance2024-02-28 49.A. Moving Chips2024-02-28 50.B. Monsters Attack!2024-02-28 51.C. Find B2024-02-28 52.D. Slimes2024-02-28 53.C. Turtle Fingers: Count the Values of k2024-02-28 54.D. Turtle Tenacity: Continual Mods2024-02-28 55.D. Vlad and Division2024-02-28 56.C. LR-remainders2024-02-28 57.D. Lonely Mountain Dungeons2024-03-12

原题链接

题解，太抽象了

最优情况一定可以是这样:

Code

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll a[200005]={0};
ll b[200005]={0};
ll l[200005]={0},r[200005]={0};
int main()
{
    cin.tie(0);
    cout.tie(0);
    ll t;
    cin>>t;
    while(t--)
    {
        ll n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++)cin>>a[i];
        for(int i=1;i<=m;i++)cin>>b[i];
        sort(a+1,a+n+1);
        sort(b+1,b+m+1);
        ll left=n+1;
        for(int i=1;i<=n;i++)
            if(abs(a[i]-b[m-i+1])<abs(a[i]-b[n-i+1]))//这里千万不能小于等于！！！,因为此时的左占可能会把下一个的右占抢走
            {
                left=i;
                break;
            }
        ll ans=0;
        for(int i=1;i<=n;i++)
        {
            if(i<left)ans+=abs(a[i]-b[m-i+1]);
            else ans+=abs(a[i]-b[n-i+1]);
        }
        cout<<ans<<endl;
    }
    return 0;
}