제출 #82697

#제출 시각아이디문제언어결과실행 시간메모리
82697heonUnija (COCI17_unija)C++11
60 / 100
419 ms9040 KiB
#include<bits/stdc++.h>

using namespace std;
int main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n;
	cin >> n;
	vector <pair<int,int>> v;
	for(int i = 0; i < n; i++){
		int x,y;
		cin >> x >> y;
		x /= 2;
		y /= 2;
		v.push_back(make_pair(x,y));
	}
	sort(v.rbegin(), v.rend());
	int mx = 0, my = 0;
	long long sol = 0;
	for(int i = 0; i < n; i++){
		if(v[i].second <= my) continue;
		sol += v[i].first * (v[i].second - my);
		mx = max(mx, v[i].first);
		my = max(my, v[i].second);
	}
  	sol *= 4;
	cout << sol;
}
#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...