BOJ 14729 - 칠무해 [C++]

문제

링크

풀이

#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
  vector<double> v(n);
  for (int i=0; i<n; i++) cin >> v[i];
  sort(v.begin(), v.end());
 
  for (int i=0; i<7; i++) cout << fixed << setprecision(3) << v[i] << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}