제출 #781647

#제출 시각아이디문제언어결과실행 시간메모리
781647vjudge1Just Long Neckties (JOI20_ho_t1)C++17
9 / 100
1069 ms11984 KiB
#include<bits/stdc++.h> using namespace std; #define lalala ios_base::sync_with_stdio(false);cin.tie(NULL); //#define endl "\n" #define ll long long #define pb push_back #define N 200005 int main(){ int n;cin>>n; vector<pair<ll int,int>> arr; vector<ll int> mus; ll int cev[n+1]; for(int i=0;i<n+1;i++){ ll int a;cin>>a; arr.pb({a,i}); } for(int i=0;i<n;i++){ ll int a;cin>>a; mus.pb(a); } sort(arr.begin(),arr.end());sort(mus.begin(),mus.end()); for(int i=0;i<n+1;i++){ ll int fark=0; int gel=0; //cout<<i<<" "<<arr[i].first<<endl; for(int j=0;j<n;j++){ if(j==i)gel=1; //cout<<arr[j+gel].first<<" "<<mus[j]<<" "<<j<<" "<<fark<<endl; if(arr[j+gel].first<=mus[j])continue; fark=max(fark,arr[j+gel].first-mus[j]); } cev[arr[i].second]=fark; } for(int i=0;i<=n;i++)cout<<cev[i]<<" "; cout<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...