제출 #1071223

#제출 시각아이디문제언어결과실행 시간메모리
1071223vjudge1Art Exhibition (JOI18_art)C++17
10 / 100
16 ms504 KiB
#include<bits/stdc++.h> using namespace std; const int N=5000; int main(){ int n; cin>>n; long long a[N],b[N]; for(int i=0 ;i<n ;i++){ cin>>a[i]>>b[i]; } long long ans=-1; for(int i=1 ;i<1<<n ;i++){ long long mn=1e18,mx=-1,s=0; vector<int> v; long long qq=i; while(qq>0){ v.push_back(qq%2); qq/=2; } //for(auto to :v){ // cout<<to<<" "; //} //cout<<"\n"; for(int j=0 ;j<n ;j++){ if (v[j]==1){ mn=min(a[j],mn); mx=max(a[j],mx); s+=b[j]; //cout<<mn<<" "<<mx<<" "<<a[j]<<" "<<b[j]<<" "<<s<<"\n"; } } ans=max(ans, s-(mx-mn)); //cout<<ans<<" "<<s-(mx-mn)<<" "<<s<<" "<<mx<<" "<<mn<<"\n"; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...