# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24979 | gabrielsimoes | Fireworks (APIO16_fireworks) | C++14 | 0 ms | 2020 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;
int main(){
int n, m;
scanf("%d %d", &n, &m);
vector<int> v; v.resize(m+n);
vector<int> p; p.resize(m+n);
for (int i = 1; i < n+m; i++)
scanf("%d %d", &p[i], &v[i]);
if (n == 1) {
sort(v.begin()+1, v.end());
ll ret = 0;
for (int i = 1; i <= m; i++) ret += abs(v[(m+1)/2] - v[i]);
return printf("%lld\n", ret), 0;
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |