Submission #762917

#TimeUsernameProblemLanguageResultExecution timeMemory
762917vjudge1Just Long Neckties (JOI20_ho_t1)C++11
9 / 100
1064 ms5484 KiB
#include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #define int long long #define f first #define s second #define pii pair<int,int> #define piii pair<int,pair<int,int>> #define vii vector<vector<int>> #define vi vector<int> #define cd complex<double> #define endl '\n' //#define multipletest using namespace std; const int LIM=2e5; const int INF = 1e18; const string name="template"; int n,m; int a[LIM+5]; int b[LIM+5]; int ans[LIM+5]; void solve(){ //CODE GOES HERE cin>>n; for(int i=0;i<=n;++i){ cin>>a[i]; } for(int i=0;i<n;++i){ cin>>b[i]; } sort(b,b+n); vector<int> v; for(int i=0;i<=n;++i){ v.clear(); for(int j=0;j<=n;++j){ if(j!=i){ v.push_back(a[j]); } } sort(v.begin(),v.end()); int mx=0; for(int i=0;i<n;++i){ mx=max(mx,max(0ll,v[i]-b[i])); } ans[i]=mx; } for(int i=0;i<=n;++i){ cout<<ans[i]<<" "; } } signed main(){ // freopen((name+".inp").c_str(),"r",stdin); // freopen((name+".out").c_str(),"w",stdout); // ifstream cin(".txt"); // ofstream cout(".txt"); //ifstream cin((name +".inp")); //ofstream cout((name +".ans")); ios_base::sync_with_stdio(false); cin.tie(NULL); int test; test=1; #ifdef multipletest cin>>test; #endif while(test--){ solve(); #ifdef DEBUG cerr << "Runtime is: " << clock() * 1.0 / CLOCKS_PER_SEC << endl; #endif } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...