Submission #921683

#	Time	Username	Problem	Language	Result	Execution time	Memory
921683		vjudge1	Safety (NOI18_safety)	C++17	5 / 100	28 ms	4320 KiB

safety

#include <bits/stdc++.h>
#define F first 
#define S second
#define ent '\n'
#define int long long
#define pb push_back

typedef long double ld;
typedef long long ll;
using namespace std;

const int maxn = 1e6+12;
const int T = 0;
const int mod = 1e9+7;

int n,m,k,x,y,l,r;
int a[maxn],b[maxn],p[maxn],pref[maxn],fact[maxn];

void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	int cal=a[n/2],cal1=a[n/2+1],ans=0,ans1=0;
	for(int i=1;i<=n;i++){
		ans+=abs(cal-a[i]);
	}
	for(int i=1;i<=n;i++){
		ans1+=abs(cal1-a[i]);
	}
	cout<<min(ans,ans1);
}	
//BEKSULTAN TOP
signed main(){	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	if(T)cin>>t;
	while(t--)solve();
} 

• Subtask 1: 0 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 5 / 5
• Subtask 5: 0 / 6
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 22
• Subtask 9: 0 / 29