Submission #12847

#TimeUsernameProblemLanguageResultExecution timeMemory
12847yongwhan점 모으기 (KOI13_collect)C++98
24 / 24
44 ms2452 KiB
#include <fstream> #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n,m; cin>>n>>m; vector<int> a(m), b(m); for (int i=0; i<m; i++) cin>>a[i]>>b[i]; sort(a.begin(), a.end()); sort(b.begin(), b.end()); int x=a[m/2], y=b[m/2], ret=0; for (int i=0; i<m; i++) ret+=abs(x-a[i])+abs(y-b[i]); cout << ret << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...