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;
int maxHeight;
bool comp (pair<int, int> & a, pair<int, int> & b) {
int air_a = a.first * (maxHeight - a.second);
int air_b = b.first * (maxHeight - b.second);
return air_a <= air_b;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, k, w, h, totalWidth = 0;
cin >> n >> k;
vector<pair<int, int>> buildings(n); // {width, height}
maxHeight = -1;
for (int i = 0; i < n; i++) {
cin >> w >> h;
if (h > maxHeight) maxHeight = h;
buildings[i] = make_pair(w, h);
}
sort(buildings.begin(), buildings.end(), comp);
for (int i = 0; i < k; i++) {
totalWidth += buildings[i].first;
}
cout << totalWidth * maxHeight << '\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... |
# | 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... |