# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296802 | Bruteforceman | Just Long Neckties (JOI20_ho_t1) | C++11 | 333 ms | 19448 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;
int n;
int a[200010], b[200010], aux[200010];
int pre[200010], suf[200010];
int solve(int p) {
vector <int> u, v;
for(int i = 1; i <= (n + 1); i++) {
if(i != p) u.push_back(a[i]);
}
for(int i = 1; i <= n; i++) {
v.push_back(b[i]);
}
sort(u.begin(), u.end());
sort(v.begin(), v.end());
int ans = 0;
for(int i = 0; i < u.size(); i++) {
ans = max(ans, u[i] - v[i]);
}
return ans;
}
int main(int argc, char const *argv[])
{
srand(time(NULL));
scanf("%d", &n);
map <int, int> id;
for(int i = 1; i <= n+1; i++) {
scanf("%d", &a[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |