Submission #923915

#TimeUsernameProblemLanguageResultExecution timeMemory
923915yeediotJust Long Neckties (JOI20_ho_t1)C++14
100 / 100
203 ms22100 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define all(x) x.begin(),x.end() #define F first #define S second #ifdef local void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);} #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif signed main(){ ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); setio(); int n; cin>>n; vector<pii>a(n+1); for(int i=0;i<=n;i++){ cin>>a[i].F; a[i].S=i; } vector<int>b(n); for(int i=0;i<n;i++)cin>>b[i]; sort(all(a)); sort(all(b)); multiset<int>st; for(int i=1;i<=n;i++){ st.insert(max(a[i].F-b[i-1],0LL)); } vector<int>ans(n+1,0); ans[a[0].S]=*st.rbegin(); for(int i=1;i<=n;i++){ st.erase(st.find(max(a[i].F-b[i-1],0LL))); st.insert(max(a[i-1].F-b[i-1],0LL)); ans[a[i].S]=*st.rbegin(); } for(int i=0;i<=n;i++){ cout<<ans[i]<<' '; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...