# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32224 | dqhungdl | Fireworks (APIO16_fireworks) | C++14 | 3 ms | 9048 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
int n,m;
vector<ii> g[300005];
bool cmp(ii x1,ii x2)
{
return x1.second<x2.second;
}
void Sub1()
{
sort(g[1].begin(),g[1].end(),cmp);
int tmp=g[1][int(g[1].size())/2].second;
int64_t res=0;
for(int i=0;i<g[1].size();i++)
res+=abs(g[1][i].second-tmp);
cout<<res;
}
int main()
{
cin>>n>>m;
int u,w;
for(int i=2;i<=n+m;i++)
{
cin>>u>>w;
g[u].push_back(ii(i,w));
}
if(n==1)
Sub1();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |