1 solutions

  • 0
    @ 2022-8-28 19:07:10
    #include<iostream>
    #include<algorithm>
    using namespace std;
    const int N=0x3f3f3f3f;
    int n,sum,k;
    int f[100005];
    int main(){
    	cin>>n;
    	for(int i=0;i<n;++i){
    		cin>>f[i];
    	}
    	sort(f,f+n);
    	k=f[n/2];
    	for(int i=0;i<n;++i){
    		sum+=abs(k-f[i]);
    	}
    	cout<<sum;
    	return 0;
    }
    

    Information

    ID
    6555
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    2
    Tags
    # Submissions
    51
    Accepted
    33
    Uploaded By