| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1341926 | minhtien | Art Exhibition (JOI18_art) | C++20 | 4 ms | 8004 KiB |
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
using namespace std;
const int N=5e5+6;
const ll inf=1e18;
int n;
vector<ii>v(N);
ll pre[N];
ll tong=-inf;
int main()
{
cin >>n;
for(int i=1;i<=n;i++){
cin >> v[i].fi >> v[i].se;
}
sort(v.begin()+1,v.begin()+1+n);
for(int i=1;i<=n;i++){
pre[i]=pre[i-1]+v[i].se;
}
for(int i=1;i<=n;i++){
ll sum=pre[i]-v[i].fi+v[1].fi;
tong=max(tong,sum);
}
cout << tong;
return 0;
}
| # | 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... | ||||
