Submission #673456

#TimeUsernameProblemLanguageResultExecution timeMemory
673456S2speedFireworks (APIO16_fireworks)C++17
7 / 100
1 ms340 KiB
#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; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>m; if(n == 1){ sub1(); return 0; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...