# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1181915 | vyaduct | Art Exhibition (JOI18_art) | C++20 | 110 ms | 12112 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(x) 42
#endif
void setIo(string in="", string out=""){
if (!in.empty() && !out.empty()){
freopen(in.c_str(), "r", stdin);
freopen(out.c_str(), "w", stdout);
}
ios::sync_with_stdio(false);
cin.tie(0);
}
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define vt vector
#define pb push_back
#define F first
#define S second
#define P pair
void solve(){
int n; cin>>n;
vt<pair<ll,ll>> A(n);
for (int i=0;i<n;i++){
cin>>A[i].F>>A[i].S;
}
sort(all(A));
vt<ll> pref(n+1, 0);
for (int i=0;i<n;i++) pref[i+1] = pref[i] + A[i].S;
ll sum=0, best=0;
for (int i=0;i<n;i++){
if (i>0)sum = max(sum + A[i].S + A[i-1].F - A[i].F, A[i].S);
else sum = A[i].S;
best = max(best, sum);
}
cout << best << endl;
}
int main() {
setIo();
int tt=1;
// cin>>tt;
while(tt--) solve();
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |