eolymp
bolt
Try our new interface for solving problems
Problems

Difference between maximum and minimum

published at 10/28/21, 10:58:01 am

int n; cin>>n; set<int>s; for(int i=0;i<n;i++) { int x; cin>>x; s.insert(x); } cout<<s.rbegin()-s.begin();

published at 1/8/24, 9:44:02 pm
#include <bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int m, n;
    cin>>m;
    vector<int> vec;
    for(int i = 0; i < m; i++){
        cin>>n;
        vec.push_back(n);
    }
    int minimum = *min_element(vec.begin(), vec.end());
    int maximum = *max_element(vec.begin(), vec.end());
    cout<<maximum-minimum<<endl;
    return 0;
}
published at 1/15/24, 11:37:41 am

include<iostream>

include<iomanip>

include<cmath>

using namespace std; int main(){ long long n,m; cin>>n; long long a[n]; for (int i=0;i<n;i++){ cin>>m; a[i]=m; } long long max=a[0],min=a[0]; for(int i=0;i<n;i++){ if(a[i]>max){ max=a[i]; } for(int i=0;i<n;i++){ if(a[i]<min){ min=a[i]; }

    }

} cout<<max-min; }

published at 1/19/24, 10:21:01 am

include<iomanip>

include<iostream>

include<cmath>

using namespace std; int main() { long long n,m,f=0; cin>> n; long long a[n]; for(int i=0;i<n;i++){ cin>> m; a[i]=m; } long long min=a[0],max=a[0]; for(int i=0;i<n;i++){ if(a[i]>max){ max=a[i];}} for(int i=0;i<n;i++){ if(a[i]<min){ min=a[i];}} cout <<max-min; }