BOJ 2012 - 등수 매기기 [C++]

문제

링크

풀이

#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
  vector<long long> v(n);
  for (int i=0; i<n; i++) cin >> v[i];
  sort(v.begin(), v.end());
 
  for (int i=0; i<n; i++) v[i] = abs(v[i] - (i+1));
  cout << accumulate(v.begin(), v.end(), 0LL);
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}