标签:sort transform round png problem 最大值 输出 个人 mem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 0 Accepted Submission(s): 0
#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> using namespace std; int main() { int t; int n; int sum=0; int a[2222]; scanf("%d",&t); while(t--){ sum=0; scanf("%d",&n); for(int i=0;i<2*n;i++){ scanf("%d",&a[i]); } sort(a,a+2*n); for(int i=0;i<n;i++){ sum+=abs(a[i]-a[2*n-i-1]); } printf("%d\n",sum); } return 0; }
标签:sort transform round png problem 最大值 输出 个人 mem
原文地址:http://www.cnblogs.com/TWS-YIFEI/p/6217882.html