제출 #703227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
703227		delrey	Unija (COCI17_unija)	C++14	100 / 100	800 ms	23464 KiB

unija

#include <bits/stdc++.h>

using namespace std;

int n;
vector < pair<int, int> > v;

int main()
{
    cin>>n;
    for(int i = 0; i < n; i++)
    {
        int x, y;
        cin>>x>>y;
        v.push_back({x, y});
    }
    sort(v.begin(), v.end());
    long long res = 0;
    int tallest = -1;
    for(int i = n - 1; i > 0; i--)
    {
        tallest = max(tallest, v[i].second);
        res += (v[i].first - v[i - 1].first) * tallest;
        //cout<<"tallest: "<<tallest<<" v["<<i<<"].first: "<<v[i].first<<" v["<<i - 1<<"].first: "<<v[i - 1].first<<endl;
    }
    tallest = max(tallest, v[0].second);
    res += v[0].first * tallest;
    cout<<res<<endl;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10