제출 #109388

#제출 시각아이디문제언어결과실행 시간메모리
109388b2563125Fireworks (APIO16_fireworks)C++14
7 / 100
3 ms384 KiB
#include<iostream> #include<algorithm> #include<vector> using namespace std; #define int long long #define vel vector<long long> #define V vector #define ll long long #define rep(i,n) for(int i=0;i<n;i++) int pr = 1000000007; void uni(vel &a) { vel ans(1, a[0]); int n = a.size(); rep(i, n - 1) { if (a[i + 1] != a[i]) { ans.push_back(a[i + 1]); } } a = ans; } int rui(int a, int n) { if (n == 0) { return 1; } int back = rui(a, n / 2); back *= back; back %= pr; if (n % 2 == 0) { return back; } return (back*a) % pr; } int inv(int a) { return rui(a, pr - 2); } signed main() { int n, m; cin >> n >> m; vel c(m); rep(i, m) { int q; cin >> q; if (q != 1) { return 1; } cin >> c[i]; } sort(c.begin(),c.end()); int mid = c[m / 2]; int ans = 0; rep(i, m) { ans += abs(c[i] - mid); } cout << ans << 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...