제출 #882943

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
882943		JakobZorz	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	241 ms	18676 KiB

ho_t1

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second

void solve(){
    int n;
    cin>>n;
    vector<pair<int,int>>a(n+1);
    vector<int>b(n);
    vector<int>ans(n+1);
    for(int i=0;i<=n;i++){
        cin>>a[i].first;
        a[i].second=i;
    }
    for(int&i:b)
        cin>>i;
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    multiset<int>s;
    for(int i=0;i<n;i++)
        s.insert(a[i+1].first-b[i]);
    
    ans[a[0].second]=max(0,*--s.end());
    for(int i=0;i<n;i++){
        s.erase(s.find(a[i+1].first-b[i]));
        s.insert(a[i].first-b[i]);
        ans[a[i+1].second]=max(0,*--s.end());
    }
    
    for(int i:ans)
        cout<<i<<" ";
    cout<<"\n";
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}

/*
 
3
3 4 7 6
2 6 4

3
6 7 3 4
2 6 4
 
5
4 7 9 10 11 12
3 5 7 9 11
 
 */

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