제출 #873658

#제출 시각아이디문제언어결과실행 시간메모리
873658vjudge1Unija (COCI17_unija)C++17
100 / 100
209 ms7000 KiB
#include<bits/stdc++.h> #ifdef LOCAL #include "Essentials/algo/debug.h" #else #define debug(...) 69 #endif using namespace std; typedef long long ll; typedef pair<int,int> pii; const int N =1e7 + 23; const ll inf = 1e18; #define F first #define S second #define pb push_back #define kill(x) cout<<x<<endl, exit(0); #define all(x) x.begin(),x.end() #define sz(x) (int)x.size() #define lc (v << 1) #define rc ((v<<1) |1) //#define int ll #define chmax(x,y) (x = max(x,y)) int n; int a[N]; int32_t main() { cin.tie(nullptr)->sync_with_stdio(false); cin>>n; for(int i = 0 ; i< n ;i ++) { int x,y; cin>>x>>y; chmax(a[x/2],y); } int mx=0; ll ans=0; for(int i = N-1; i>= 1; i --) { chmax(mx,a[i]); ans += mx; } cout<<ans*2 << '\n'; 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...