#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n,i,j,ans=0,a,b,c,k=0;
cin>>n;
vector<pair<ll,ll>> x(n);
for(i=0 ; i<n ; i++){
cin>>x[i].first>>x[i].second;
ans+=x[i].first*x[i].second;
}
sort(x.rbegin(),x.rend());
k=x[0].second;
for(i=1 ; i<n ; i++){
if(x[i].second>k){
ans-=x[i].first*k;
}
else{
ans-=x[i].second*x[i].first;
}
k=max(k,x[i].second);
}
cout<<ans;
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |