Submission #110363

#	Time	Username	Problem	Language	Result	Execution time	Memory
110363		Leonardo_Paes	Coin Collecting (JOI19_ho_t4)	C++11	0 / 100	3 ms	384 KiB

joi2019_ho_t4

#include <bits/stdc++.h>

using namespace std;

typedef pair<long long, long long> pii;

int main(){

    int n;

    cin >> n;

    priority_queue<pii> fila;

    long long ans=0;

    for(int i=1; i<=2*n; i++){
        pii atual;

        cin >> atual.first >> atual.second;

        fila.push(atual);
    }

    for(int i=n; i>=1; i--){
            pii atual1 = fila.top();
            fila.pop();
            pii atual2 = fila.top();
            fila.pop();
            long long dist1 = abs(atual1.first-i) + abs(atual1.second-1);
            dist1 += abs(atual2.first-i) + abs(atual2.second-2);
            long long dist2 = abs(atual2.first-i) + abs(atual2.second-1);
            dist2 += abs(atual1.first-i) + abs(atual1.second-2);
            ans+=min(dist1, dist2);
    }

    cout << ans << endl;

    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63