# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054238 | Kipras | Safety (NOI18_safety) | C++17 | 2092 ms | 2616 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;
typedef long long ll;
typedef pair<ll, ll> pl;
const ll maxC = 5010;
ll n, h;
vector<ll> diffs;
ll res = 1e18;
ll median = 0;
void solve() {
vector<ll> a;
for(int i = 0; i < n; i++) {
ll aa;
cin>>aa;
a.push_back(aa);
}
sort(a.begin(), a.end());
median=a[n/2];
ll lRes=0;
for(auto i : a) {
lRes+=abs(i-median);
}
if(n%2==0) {
median=a[(n+2)/2];
res=0;
for(auto i : a) {
res+=abs(i-median);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |