제출 #1287315

#제출 시각아이디문제언어결과실행 시간메모리
1287315eri16Art Exhibition (JOI18_art)C++20
0 / 100
5 ms332 KiB
#include <bits/stdc++.h> using namespace std; void solve_2_n(vector <pair<int,int>> v){ long long best=LLONG_MIN; int n=v.size(); for(int mask=0; mask<(1<<n); mask++){ long long S=0; int amin=-1,amax=0; for(int i=0;i<n;i++){ if(mask & (1<<i)){ if (amin==-1){amin=v[i].first;} amin=min(amin,v[i].first); amax=max(amax,v[i].first); S+=v[i].second; } } best=max(best,S+amin-amax); } cout<<best<<"\n"; } int main(){ int n,tm1,tm2; cin>>n; vector <pair<int,int>> v; for (int i=0; i<n; i++){ cin>>tm1>>tm2; v.push_back({tm1,tm2}); } solve_2_n(v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...