제출 #666939

#제출 시각아이디문제언어결과실행 시간메모리
666939Darren0724Just Long Neckties (JOI20_ho_t1)C++17
100 / 100
106 ms12388 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define all(x) x.begin(),x.end() signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n;cin>>n; vector<pair<int,int>> a(n+1); vector<int> b(n); for(int i=0;i<=n;i++){ cin>>a[i].first; a[i].second=i; } for(int &i:b){ cin>>i; } sort(all(a)); sort(all(b)); vector<int> ans(n+1); for(int i=0;i<n;i++){ ans[a[n].second]=max(ans[a[n].second],a[i].first-b[i]); } for(int i=n-1;i>=0;i--){ ans[a[i].second]=max(ans[a[i+1].second],a[i+1].first-b[i]); } for(int i=0;i<=n;i++){ cout<<ans[i]<<' '; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...