Submission #948331

#TimeUsernameProblemLanguageResultExecution timeMemory
948331ezzzayJust Long Neckties (JOI20_ho_t1)C++14
9 / 100
1038 ms10972 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second #define pb push_back const int N=2e5+5; vector<int>b; int a[N]; void fun(vector<int>v){ sort(v.begin(),v.end()); int n=b.size(); int s=0; for(int i=0;i<n;i++){ s=max(s,v[i]-b[i]); } cout<<s<<" "; } signed main(){ int n; cin>>n; for(int i=1;i<=n+1;i++)cin>>a[i]; for(int i=1;i<=n;i++){ int a; cin>>a; b.pb(a); } sort(b.begin(),b.end()); for(int i=1;i<=n+1;i++){ vector<int>vc; for(int j=1;j<=n+1;j++){ if(i==j)continue; vc.pb(a[j]); } fun(vc); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...