[C++백준 1246번:온라인 판매]

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int n, m, val;
vector<int> v;
 
int main() {
    cin >> n >> m;
 
    for (int i = 0; i < m; i++) {
        cin >> val;
        v.push_back(val);
    }
 
    sort(v.begin(), v.end());
 
    long long max = 0;
    int index;
    for (int i = 0; i < v.size(); i++) {
        if (v.size() - i <= n) {
            if (v[i] * ((long long)v.size() - i) > max) {
                max = v[i] * ((long long)v.size() - i);
                index = i;
            }
        }
    }
    cout << v[index] << ' ' << max;
}