제출 #1237364

#제출 시각아이디문제언어결과실행 시간메모리
1237364nerrrminJust Long Neckties (JOI20_ho_t1)C++20
0 / 100
0 ms320 KiB
#include<bits/stdc++.h>
#define endl '\n'
#define pb push_back
using namespace std;
const int maxn = 2e5 + 10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int n, a[maxn], b[maxn];
int main()
{
    speed();

    cin >> n;
    for (int i = 1; i <= n+1; ++ i)
        cin >> a[i];
    for (int i = 1; i <= n; ++ i)
        cin >> b[i];
    sort(a+1, a+n+1+1);
    sort(b+1, b+n+1);
    multiset < int > s;
    for (int i = 1; i <= n; ++ i)
        s.insert(abs(a[i+1] - b[i]));
    cout << *s.rbegin() << " ";
    for (int i = 2; i <= n+1; ++ i)
    {
        int other = abs(a[i] - b[i-1]);
        s.erase(s.find(other));
        int newone = abs(a[i-1] - b[i-1]);
        s.insert(newone);

        cout << *s.rbegin() << " ";
    }
    cout << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...