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>
using namespace std;
#define nl "\n"
#define ll long long
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main() {
fast
int n;
cin>>n;
vector<pair<ll,ll>>art;
ll sofva=0;
for(int i=0;i<n;i++)
{ll siz,va;
cin>>siz>>va;
art.push_back({siz,va});sofva+=va;
}
sort(art.begin(),art.end());
reverse(art.begin(),art.end());
// for(int i=0;i<n;i++)cout<<art[i].fi<<art[i].se<<nl;
ll mi=art[n-1].fi;
ll ma=-1;
for(int i=0;i<n;i++)
{
if(sofva-(art[i].fi-mi)>ma)
{
ma=sofva-(art[i].fi-mi);
sofva-=art[i].se;
}else {sofva-=art[i].se; continue;}
}
cout<<ma;
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... |