1285번 아름이의 돌 던지기

Problem Solving - Level 2 - 아름이의 돌 던지기

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV18-stqI8oCFAZN&categoryId=AV18-stqI8oCFAZN&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=3 

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int T;
    cin>>T;
    
    for(int i=1;i<=T;i++)
    {
        int num,distance,count=0,min=100000;
        cin>>num;
        for(int j=0;j<num;j++)
        {
            cin>>distance;
            distance=abs(distance);
            if(distance<min)
            {
                min=distance;
                count=1;
            }
            
            else if(distance==min)
            {
                count++;
            }
        }
        cout<<"#"<<i<<" "<<min<<" "<<count<<endl;
    }
    return 0;
}