# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673456 | S2speed | Fireworks (APIO16_fireworks) | C++17 | 1 ms | 340 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;
#pragma GCC optimize ("Ofast")
#define all(x) x.begin() , x.end()
#define sze(x) (ll)(x.size())
typedef long long ll;
const ll maxn = 1e5 + 17 , md = 1e9 + 7;
ll n , m;
vector<ll> v;
void sub1(){
for(ll i = 0 ; i < m ; i++){
ll w;
cin>>w>>w;
v.push_back(w);
}
sort(all(v));
ll f = v[m / 2] , ans = 0;
for(ll i = 0 ; i < m ; i++){
ans += abs(v[i] - f);
}
cout<<ans<<'\n';
return;
}
# | 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... |