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 pb push_back
#define X first
#define Y second
typedef pair <int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n;
cin>> n;
vector <pii> v;
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i].X >> v[i].Y;
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
long long povrsina = 0;
int maks = 0;
for (int i = 0; i < n; i++) {
if (v[i].Y > maks) {
povrsina += (v[i].Y - maks) * v[i].X;
maks = v[i].Y;
}
}
cout << povrsina;
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... |