Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <iomanip>
- using namespace std;
- template<class T> int FindMin(T *arr, int size);
- template<class T> T FindSum(T *arr, int size);
- template<class T> T *Sort(T *arr, int size);
- int main() {
- double *counts;
- int n;
- cin >> n;
- counts = new double[n];
- for (int i = 0; i < n; i++) {
- cin >> counts[i];
- }
- cout << FindMin(counts, n) + 1 << " " << fixed << setprecision(6) << FindSum(counts, n) << endl;
- counts = Sort(counts, n);
- for (int i = 0; i < n; i++) {
- cout << fixed << setprecision(2) << counts[i] << " ";
- }
- cout << endl;
- cin.get();
- return 0;
- }
- template<class T> int FindMin(T *arr, int size) {
- int min = 0;
- for (int i = 1; i < size; i++) {
- if (arr[i] < arr[min]) {
- min = i;
- }
- }
- return min;
- }
- template<class T> T FindSum(T *arr, int size) {
- T sum = 0;
- for (int i = 0; i < size; i++) {
- if (arr[i] < 0) {
- for (int n = i + 1; n <= size; n++) {
- if (arr[n] < 0) {
- break;
- }
- sum += arr[n];
- }
- break;
- }
- }
- return sum;
- }
- template<class T> T *Sort(T *arr, int size) {
- T *result = new T[size];
- int b = 0;
- for (int i = 0; i < size; i++) {
- if (fabs(arr[i]) <= 1) {
- result[b] = arr[i];
- b++;
- }
- }
- for (int i = 0; i < size; i++) {
- if (fabs(arr[i]) > 1) {
- result[b] = arr[i];
- b++;
- }
- }
- return result;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement