| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345079 | fatime_aslan_156 | Art Exhibition (JOI18_art) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,c=0,s=0,l=0;
cin>>n;
vector<pair<ll,ll>>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i].first>>v[i].second;
}
sort(v.begin(),v.end());
c+=v[0].second;
s=c;
for(int i=1;i<n;i++)
{
c+=v[i].second;
s=max(s,c-(v[i].first-v[l].first));
while(l<i && c-v[l].second-(v[i].first-v[l+1].first)>s)
{
s=c-v[l].second-(v[i].first-v[l+1].first);
c-=v[l].second;
l++;
}
}
cout<<s;
}| # | 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... | ||||
