제출 #1147333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147333		aldo2902	Coin Collecting (JOI19_ho_t4)	C++20	0 / 100	0 ms	328 KiB

joi2019_ho_t4

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main() {
    int N;
    cin >> N;
    int totalCoins = 2 * N;

    vector<pair<long long, long long>> coins(totalCoins);
    for (int i = 0; i < totalCoins; ++i) {
        cin >> coins[i].first >> coins[i].second;
    }

    sort(coins.begin(), coins.end());

    vector<pair<long long, long long>> targetPositions(totalCoins);
    for (int i = 0; i < N; ++i) {
        targetPositions[2 * i] = {i + 1, 1};
        targetPositions[2 * i + 1] = {i + 1, 2};
    }

    sort(targetPositions.begin(), targetPositions.end());

    long long totalOperations = 0;
    for (int i = 0; i < totalCoins; ++i) {
        totalOperations += abs(coins[i].first - targetPositions[i].first) + abs(coins[i].second - targetPositions[i].second);
    }

    cout << totalOperations << endl;

    return 0;
}

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