Submission #1130748

#TimeUsernameProblemLanguageResultExecution timeMemory
1130748Champ_NamanFireworks (APIO16_fireworks)C++20
0 / 100
5 ms7236 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define nl '\n' const int N = 300001; vector<pair<int,int>> g[N]; inline void solve(){ int n, m; cin>>n>>m; vector<int> v; for(int i=1; i<=n+m; i++){ int p, c; cin>>p>>c; g[p].push_back({i, c}); v.push_back(c); } sort(v.begin(), v.end()); int x = v[m/2]; int ans = 0; for(int y : v) ans += abs(x-y); cout<<ans; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL); int t = 1; //cin>>t; while(t--) solve(); 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...