제출 #61172

#제출 시각아이디문제언어결과실행 시간메모리
61172dukati8Fireworks (APIO16_fireworks)C++14
7 / 100
4 ms668 KiB

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i=a; i<int(b); i++)

int main() {
  int n,m;
  cin >> n >> m;
  vector<int>p(n+m-1);
  vector<long long>c(n+m-1);
  rep (i,0,n+m-1) {
    cin >> p[i] >> c[i];
    p[i]--; //0-indexed
  }
  if (n==1 && m<=100) {
    rep (i,0,m) {
      assert(p[i]==0);
    }
    sort(c.begin(),c.end());
    long long goal=c[m/2];
    long long ans=0;
    rep (i,0,m) {
      ans+=abs(goal-c[i]);
    }
    cout << ans << endl;
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...