Submission #600594

#TimeUsernameProblemLanguageResultExecution timeMemory
600594starchanUnija (COCI17_unija)C++17
100 / 100
334 ms31076 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)1e6+1
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
vector<in> p;
signed main()
{
	fast();
	int n;
	cin >> n;
	p.resize(n+1);
	for(int i = 1; i <= n; i++)
	{
		int x, y;
		cin >> x >> y;
		x/=2;
		y/=2;
		p[i] = {x, y};
	}
	p[0] = {INF, -INF};
	sort(p.rbegin(), p.rend());
	int ans = 0;
	int prevy = 0;
	for(int i = 1; i <= n; i++)
	{
		if(p[i].s > prevy)
		{
			ans+=((p[i].s-prevy)*p[i].f);
			prevy = p[i].s;
		}
	}
	cout << 4*ans;
	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...
#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...