# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941864 | Litusiano | Just Long Neckties (JOI20_ho_t1) | C++14 | 1 ms | 356 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n; cin>>n;
vector<int> v(n+1); for(int& i : v) cin>>i;
vector<int> b(n); for(int& i : b) cin>>i;
sort(v.begin(),v.end()); sort(b.begin(),b.end());
for(int i = 0; i<=n; i++){
vector<int> v1;
for(int j = 0; j<=n; j++){
if(i == j) continue;
v1.push_back(v[j]);
}
int ans = 0;
for(int j = 0; j<n; j++){
ans = max(ans,max(0ll,v1[j] - b[j]));
}
cout<<ans<<" ";
}
cout<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |