제출 #1174094

#제출 시각아이디문제언어결과실행 시간메모리
1174094selunelleUnija (COCI17_unija)C++20
0 / 100
446 ms16068 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
	ll n,m,i,j,k=0,a,b,x,y;
	cin>>n;
	vector<pair<ll,ll> > v(n+1);
	for(i=0;i<n;i++){
		cin>>a>>b;
		v[i]={a/2,b/2};
	}
	v[n]={0,0};
	sort(v.begin(),v.end());
	for(i=n;i>0;i--){
		k+=(v[i].first-v[i-1].first)*v[i].second;
	}
	cout<<k*4;
}
#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...