Submission #1174027

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174027		nuutsnoynton	Unija (COCI17_unija)	C++20	100 / 100	450 ms	32584 KiB

unija

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
	ll n, m, r, mx_x, y_val, i, j, ans, t;

	cin >> n;
	
	ll x[n + 2], y[n + 2];
	
	vector < pair < ll, ll > > v;
	for (i = 1; i <= n; i ++) {
		cin >> x[i] >> y[i];
		v.push_back(make_pair(y[i], x[i]));
		x[i]/=2;
		y[i]/=2;
	}
	v.push_back(make_pair(0, 1e7));
	sort(v.rbegin(), v.rend());
	ans = 0;
	y_val = 1e7;
	mx_x = 0;
	for (i = 0; i < v.size(); i ++) {
		if ( v[i].second > mx_x) {
			ans = ans + ((y_val - v[i].first) * mx_x);
			mx_x = v[i].second;
			y_val = v[i].first;
		}
	}
	cout << ans << endl;
	
}

• 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