제출 #397628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
397628		Alma	Kisik (COCI19_kisik)	C++17	0 / 90	219 ms	5452 KiB

kisik

#include <bits/stdc++.h>
#define width first
#define height second
using namespace std;

int maxHeight;

bool comp (pair<int, int> & a, pair<int, int> & b) {
    int air_a = a.width * maxHeight;
    int air_b = b.width * maxHeight;
    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].width;
    }
    cout << totalWidth * maxHeight << '\n';
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10