勿抄
2026-01-01 00:46:25
发布于:上海
5阅读
0回复
0点赞
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
防抄码9999999990
#include<climits>
#include<clocale>
#include<cmath>
#include<complex>
#include<csignal>
#include<csetjmp>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
防抄码9999999990
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector> //头文件(49行)
using namespace std;防抄码9999999990 const int N=1e4+3,inf=2147483647;int n;int a[N];int x[N];int main(){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){x[j]+=abs(a[i]-a[j]);}}int minn=inf;for(int i=1;i<=n;i++)防抄码9999999990 minn=x[i]<minn?x[i]:minn;printf("%d\n",minn);return 0;}
用 <bits/stdc++.h>
这里空空如也

有帮助,赞一个