| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1115251 | staszic_ojuz | Art Exhibition (JOI18_art) | C++17 | 1055 ms | 8272 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 <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin>>n;
vector<pair<long long, long long>> vect(n);
for (long long i=0;i<n;i++) cin>>vect[i].first>>vect[i].second;
sort(vect.begin(), vect.end());
long long best=0;
for (long long i=0;i<n;i++){
long long sum=0;
for (long long j=i;j<n;j++){
sum+=vect[j].second;
if (best<sum-vect[j].first+vect[i].first) best=sum-vect[j].first+vect[i].first;
}
}
cout<<best<<'\n';
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... | ||||
