Submission #1313940

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313940		yusifm	Just Long Neckties (JOI20_ho_t1)	C++20	9 / 100	1092 ms	6404 KiB

ho_t1

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=100001,INF=1000000000;
using namespace std;
void solve()
{
    ll n,num1,num2,ans;
    cin>>n;
    vector<ll>nums1,nums2,res;
    for(int i=0;i<n+1;i++)
    {
        cin>>num1;
        nums1.pb(num1);
    }
    for(int i=0;i<n;i++)
    {
        cin>>num2;
        nums2.pb(num2);
    }
    sort(all(nums2));
    for(int i=0;i<nums1.size();i++)
    {
        res.clear(),ans=-INF;
        for(int j=0;j<nums1.size();j++)
        {
            if(i!=j)
            {
                res.pb(nums1[j]);
            }
        }
        sort(all(res));
        for(int j=0;j<res.size();j++)
        {
            ans=max(ans,max(0LL,res[j]-nums2[j]));
        }
        cout<<ans<<" ";
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 0 / 91