Skip to content

Commit

Permalink
구조체 연습 6문제
Browse files Browse the repository at this point in the history
  • Loading branch information
ksg97031 committed Jun 8, 2019
1 parent 65e532a commit f18748f
Show file tree
Hide file tree
Showing 7 changed files with 100 additions and 1 deletion.
3 changes: 2 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1 +1,2 @@
"# ksg"
## ksg
https://codeup.kr/problemsetsol.php?psid=28 ~ 3108
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
N = int(input())

L = []
for i in range(N):
L.append(tuple(map(int, input().split(" "))))

L.sort(key = lambda x : x[0])
for i in L:
print(str(i[0]) + " " + str(i[1]))
9 changes: 9 additions & 0 deletions codeup/구조체 연습/3004 데이터 재정렬/solution.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
from bisect import bisect
N = int(input())

dic = {}
input_data = list(map(int, input().split(" ")[:-1]))
copy_data = list(input_data)
input_data.sort()

print(" ".join([str(bisect(input_data, x) - 1) for x in copy_data]))
11 changes: 11 additions & 0 deletions codeup/구조체 연습/3015 성적표 출력/solution.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
n, m = list(map(int, input().split(" ")))
l = []

for i in range(n):
Name, Score = input().split(" ")
l.append([Name, int(Score)])

l.sort(key = lambda x: x[1], reverse=True)

for i in range(m):
print(l[i][0])
26 changes: 26 additions & 0 deletions codeup/구조체 연습/3016 1등한 학생의 성적/solution.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
import sys
n = int(input())

DS = []
NAME = 0
SCORES = 1
for i in range(n):
Name, *Scores = input().split(" ")
Scores = list(map(int, Scores))
DS.append([Name, Scores])

DS.sort(key=lambda x: x[1][0], reverse=True)


NumberOneStudent = DS[0]
del DS[0]

sys.stdout.write(NumberOneStudent[NAME] + " ")
for i in range(1, n):
Rank = 1
for Other in DS:
if NumberOneStudent[SCORES][i] < Other[SCORES][i]:
Rank += 1

sys.stdout.write(str(Rank) + " ")

15 changes: 15 additions & 0 deletions codeup/구조체 연습/3019 스케줄 정리/solution.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
import sys
n = int(input())

data = []
for _ in range(n):
memo, *args = input().split(" ")
data.append([memo, list(map(int, args))])

data.sort(key = lambda x: x[0])
data.sort(key = lambda x: x[1][2])
data.sort(key = lambda x: x[1][1])
data.sort(key = lambda x: x[1][0])

for i in data:
print(i[0])
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
import sys
import bisect
n = int(input())

data = []
names = []
for _ in range(n):
c, no, name = input().split(" ")
no = int(no)
if no not in data:
if c == 'I':
data.append(no)
names.append(name)
else:
if c == 'D':
i = bisect.bisect(data, no)
del data[i-1]
del names[i-1]

S = False
R = sorted(list(zip(data, names)), key=lambda x:x[0])
for x in input().split(" "):
if S: sys.stdout.write("\n")
x = int(x) - 1
sys.stdout.write(str(R[x][0]) + " " + R[x][1])
S = True


0 comments on commit f18748f

Please sign in to comment.