제출 #861583

#제출 시각아이디문제언어결과실행 시간메모리
861583PagodePaivaGift (IZhO18_nicegift)C++17
7 / 100
212 ms32984 KiB
#include<bits/stdc++.h>

using namespace std;

int main(){
    int n, k;
    cin >> n >> k;

    priority_queue <pair <int, int>> pq;

    for(int i = 0;i < n;i++){
        int x;
        cin >> x;
        pq.push({x, i});
    }

    vector <array <int, 3>> resp;

    while(!pq.empty()){
        if(pq.size() == 1){
            cout << -1 << '\n';
            return 0;
        }

        auto [val, pos] = pq.top();
        pq.pop();

        auto [val2, pos2] = pq.top();
        pq.pop();

        val -= val2;

        resp.push_back({val2, pos, pos2});

        if(val != 0) pq.push({val, pos});
    }

    cout << resp.size()<< '\n';

    for(auto x : resp){
        cout << x[0] << ' ' << x[1]+1 << ' ' << x[2]+1 << '\n';
    }

    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...
#Verdict Execution timeMemoryGrader output
Fetching results...