登 录
/*<br /> File: 10041.cpp<br /> Author: ACboy<br /> Date: 2010-3-31<br /> Result: AC<br /> Descripition: UVa 10041 Vito's Family (median selection)<br /> */</p> <p>#include <iostream><br /> #include <algorithm><br /> using namespace std;</p> <p>int data[30100];</p> <p>int get_distance(int pos, int n) {<br /> int res = 0;<br /> for (int i = 0; i < n; i++) {<br /> res += abs(pos - data[i]);<br /> }<br /> return res;<br /> }</p> <p>int main()<br /> {<br /> int n;<br /> #ifndef ONLINE_JUDGE<br /> freopen("10041.txt", "r", stdin);<br /> #endif<br /> cin >> n;</p> <p> while (n--)<br /> {<br /> int i;<br /> int count;<br /> cin >> count;<br /> int total = 0;<br /> for (i = 0; i < count; i++) {<br /> cin >> data[i];<br /> total += data[i];<br /> }<br /> sort(data, data + count);<br /> int pos;<br /> int result;<br /> if (count % 2 == 0) {<br /> pos = (data[count / 2] + data[count / 2 - 1]) / 2;<br /> result = get_distance(pos, count);<br /> } else {<br /> pos = data[count / 2];<br /> result = get_distance(pos, count);<br /> }<br /> cout << result << endl;<br /> }<br /> return 0;<br /> }<br />
抱歉!评论已关闭.