fork download
  1. // Author : AkSHAYA
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4.  
  5. //Macros
  6. #define fast ios_base::sync_with_stdio(0);
  7. #define io cin.tie(0); cout.tie(0);
  8. #define ff first
  9. #define ss second
  10. #define pb push_back
  11. #define mk make_pair
  12. #define all(x) (x).begin(), (x).end()
  13. #define in(array) ll x;cin>>x; array.pb(x);
  14. #define fo(i,a,b) for(ll i=a;i<b;i++)
  15. #define rev(i,a,b) for(ll i=a;i>=b;i--)
  16. #define tc ll T;cin>>T;while(T--)
  17. #define vl vector<ll>
  18. #define vvl vector<vl>
  19. #define ll long long
  20. #define ull unsigned long long
  21. #define lld long double
  22. #define yes cout<<"YES"<<"\n";
  23. #define no cout<<"NO"<<"\n";
  24.  
  25. //Constants
  26. const lld PI= 3.141592653589793238;
  27. const ll INF= 1e18;
  28. const ll mod=1e9+7;
  29.  
  30. //debug
  31. #ifndef ONLINE_JUDGE
  32. #define debug(x) cerr<<#x<<"---"<<x<<endl;
  33. #else
  34. #define debug(x)
  35. #endif
  36.  
  37. //Mathematical functions
  38. ll gcd(ll a, ll b){if (b == 0)return a;return gcd(b, a % b);}
  39. ll lcm(ll a, ll b){return ((a/gcd(a,b))*b);}
  40. ll binpow(ll a,ll b){ll ans = 1;while(b > 0){if (b & 1)ans = (ans%mod *a%mod)%mod;a =(a%mod* a%mod)%mod;b >>= 1;}return ans%mod;}
  41. bool is_prime(ll n){if(n==2) return true;else if (n <= 1||n>1000000||n%2==0) return false;for (int i = 3; i*i<= n; i+=2) if (n % i == 0) return false;return true;}
  42. void prime_factors(ll n){map<ll,ll>m;for(ll i=2;i*i<=n;i++) while(n%i==0){ m[i]++; n/=i; } if(n>1) m[n]++; for(auto x:m)cout<<x.first<<"----"<<x.second<<"\n";}
  43.  
  44. //**************************************************************************//
  45. void solve(){
  46. ll n;cin>>n;
  47. vector<ll>a;
  48. fo(i,0,n){in(a)}
  49. sort(all(a));
  50. ll x=a.size()/2;
  51. ll cnt=0;
  52. fo(i,0,n){
  53. cnt+=abs(a[x]-a[i]);
  54. }
  55. cout<<cnt<<"\n";
  56.  
  57. }
  58.  
  59.  
  60. int main(){
  61. #ifndef ONLINE_JUDGE
  62. freopen("error.txt","w",stderr);
  63. #endif
  64. fast io
  65. solve();
  66. return 0;
  67. }
Success #stdin #stdout 0.01s 5520KB
stdin
5
2 3 1 5 2
stdout
5