Submission #2298194

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <bitset>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long ll;

#define ALL(obj) (obj).begin(), (obj).end() 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)

int main(){
    int n,cost;
    cin >> n;
    bool used[n];
    rep(i,n) used[i] =true;
    priority_queue<pair<int, pair<int,int> > > q;
    rep(i,n-1){
        rep(j,n-i-1){
            int c;
            cin >> c;
            q.push(make_pair(c,make_pair(i,j+1)));
        }        
    }
    while(!q.empty()){
    pair<int, pair<int,int> > tem = q.top();
    q.pop();
    if(used[tem.second.first] && used[tem.second.second]){
        used[tem.second.first]=false;
        used[tem.second.second]=false;
        cost += tem.first;
    }
    }
    cout << n << " ";
    cout << cost << endl;
    return 0;
}

Submission Info

Judge Result