| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1100634 | stdfloat | Just Long Neckties (JOI20_ho_t1) | C++17 | 1047 ms | 7408 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;
using ll = long long;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &i : a)
cin >> i;
vector<int> b(n);
for (auto &i : b)
cin >> i;
sort(b.begin(), b.end());
for (int i = 0; i <= n; i++) {
vector<int> v;
for (int j = 0; j <= n; j++)
if (i != j) v.push_back(a[j]);
sort(v.begin(), v.end());
int mx = 0;
for (int j = 0; j < n; j++)
mx = max(mx, v[j] - b[j]);
cout << mx << ' ';
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
