[Softeer] Lv1: [한양대 HCPC 2023] Tren del Fin del Mundo(7695) 해설

문제

- 문제 링크: [한양대 HCPC 2023] Tren del Fin del Mundo

 

풀이

(C언어)

solution 1)

- 시간 복잡도: 

#include <stdio.h>


int main(void)
{
    int n;
    scanf("%d", &n);
    int x, y;
    int min_y = 1001;
    int min_x = 0;
    for (int i = 0; i < n; ++i) {
        scanf("%d %d", &x, &y);
        if (y < min_y) {
            min_x = x;
            min_y = y;
        }
    }

    printf("%d %d", min_x , min_y);
   return 0;
}

 

(C++)

solution 1)

- 시간 복잡도: 

#include<iostream>

using namespace std;

int main(int argc, char** argv)
{
    int n;
    cin >> n;
    int x, y;
    int min_y = 1001;
    int min_x = 0;
    for (int i = 0; i < n; ++i) {
        cin >> x >> y;
        if (y < min_y) {
            min_x = x;
            min_y = y;
        }
    }

    cout << min_x << " " << min_y;
   return 0;
}

 

(Java)

solution 1)

- 시간 복잡도: 

import java.util.*

 

(Python)

solution 1)

- 시간 복잡도: 

import sys

n = int(input())
x, y = 0, 0
min_y = 1001;
min_x = 0;
for i in range(n):
    x, y = map(int, input().split())
    if (y < min_y):
        min_x = x
        min_y = y
print(f"{min_x} {min_y}");

 

(JavaScript)

solution 1)

- 시간 복잡도: 

import