# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123900 | naderjemel | Fireworks (APIO16_fireworks) | C++17 | 2 ms | 376 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 fi first
#define se second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<pair<int,int> > vii;
int main(){
int n,m; scanf("%d%d",&n,&m);
vi bs;
for(int i=0;i<m+n-1;i++){
int a,b; scanf("%d%d",&a,&b);
bs.pb(b);
}
sort(bs.begin(),bs.end());
int md=bs[m/2];
ll rs=0;
for(int i=0;i<m+n-1;i++){
rs+=abs((ll)md-(ll)bs[i]);
}
printf("%lld\n",rs);
return 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... |