BOJ 9785 - Damage Over Time [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
 
void solve(void) {
  int n, m; cin >> n >> m;
  vector<pair<int, int>> v(n);
  for (int i=0; i<n; i++) cin >> v[i].first >> v[i].second;
  sort(v.begin(), v.end(), greater<pair<int, int>>());
 
  int a = 0, b = 1e9;
  for (int i=0; i<m; i++) {
    a += v[i].first;
    b = min(b, v[i].second);
  }
  cout << a << " " << b;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}