# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108357 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 1 ms | 2384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 5;
int n;
pair<int, int> item[N];
int p[N];
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
#define Task "Flower"
if(fopen(Task".inp","r")){
freopen(Task".inp","r",stdin);
freopen(Task".out","w",stdout);
}
cin >> n;
for(int i = 1; i <= n; i++){
cin >> item[i].first >> item[i].second;
}
sort(item + 1, item + n + 1);
for(int i = 1; i <= n; i++){
p[i] = p[i - 1] + item[i].second;
}
int res = 0;
for(int i = 1; i <= n; i++){
res = max(res, p[i] + item[1].first - item[i].first);
}
cout << res;
}
Compilation message (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... |