题目1483：求最大最小数

最新推荐文章于 2022-12-09 11:58:32 发布

Aden2224

最新推荐文章于 2022-12-09 11:58:32 发布

阅读量559

点赞数

分类专栏：九度OJ

本文链接：https://blog.csdn.net/GQ_BOB/article/details/70887317

版权

九度OJ 专栏收录该内容

299 篇文章 1 订阅

订阅专栏

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
#include <climits>
using namespace std;
//1483
int n;
vector<int> v;
int main(){
  //  freopen("input.txt","r",stdin);
    while(scanf("%d",&n)!=EOF){
        int t;
        v.clear();
        while(n--){
            scanf("%d",&t);
            v.push_back(t);
        }
        printf("%d %d\n",*max_element(v.begin(),v.end()),*min_element(v.begin(),v.end()));
    }
    return 0;
}
/**************************************************************
    Problem: 1483
    User: cust123
    Language: C++
    Result: Accepted
    Time:30 ms
    Memory:1520 kb
****************************************************************/