Add silvers

dev-jelly · dev-jelly · commit f2a36c53a7be · 2021-09-18T16:46:03.000+09:00
diff --git a/boj/1037/main/main.go b/boj/1037/main/main.go
@@ -2,36 +2,29 @@ package main
 
 import (
 	"fmt"
+	"math"
 	"sort"
 )
 
 func main() {
 	var n int
-	var y int
-	var big uint64 = 1
+	var y uint64
 	fmt.Scan(&n)
-	a :=1
 	var s []int
-	if n == 0 {
-		fmt.Println(1)
-		return
-	}
-	if n == 1{
-		fmt.Scan(&y)
-		fmt.Println(y)
-	}
+
+	min := uint64(math.MaxUint32)
+	max := uint64(0)
 	for i := 0; i < n; i++ {
 		fmt.Scan(&y)
-		big *= uint64(y)
-		s = append(s, y)
+		if  y < min {
+			min = y
+		}
+		if max < y {
+			max = y
+		}
 	}
 	sort.Ints(s)
-	mostBig := uint64(s[len(s)-1])
-	var i uint64 = mostBig
-	var candis []uint64
-	for ; i <= big; i += mostBig {
-		candis = append(candis, mostBig)
-	}
 
-	fmt.Println(a)
+
+	fmt.Println(min * max)
 }
diff --git a/boj/10610/main.go b/boj/10610/main.go
@@ -0,0 +1,39 @@
+package main
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"sort"
+)
+var reader = bufio.NewReaderSize(os.Stdin, 4000004)
+var writer = bufio.NewWriter(os.Stdout)
+
+func main() {
+	defer writer.Flush()
+	var n string
+	fmt.Fscan(reader, &n)
+	include0 := false
+	var sum = 0
+	var ns []int
+	for _, ch := range n {
+		a := int(ch) - '0'
+		if a == 0 {
+			include0 = true
+		}
+		ns = append(ns, a)
+		sum += a
+	}
+	if !include0 || sum % 3 != 0 {
+		fmt.Fprint(writer, -1)
+		return
+	}
+	sort.Ints(ns)
+	for i, j := 0, len(ns)-1; i < j; i, j = i+1, j-1 {
+		ns[i], ns[j] = ns[j], ns[i]
+	}
+
+	for _, i := range ns {
+		fmt.Fprint(writer, i)
+	}
+}
diff --git a/boj/1094/main.go b/boj/1094/main.go
@@ -0,0 +1,23 @@
+package main
+
+import "fmt"
+
+func main() {
+	var x int
+	fmt.Scanf("%d", &x)
+
+	if x == 64 {
+		fmt.Println(1)
+		return
+	}
+	ans := 0
+	a := 32
+	for x > 0 {
+		if x >= a {
+			x -= a
+			ans++
+		}
+		a /= 2
+	}
+	fmt.Println(ans)
+}
diff --git a/boj/11004/main.go b/boj/11004/main.go
@@ -0,0 +1,30 @@
+package main
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"sort"
+	"strconv"
+)
+var sc = bufio.NewScanner(os.Stdin)
+var writer = bufio.NewWriter(os.Stdout)
+func main() {
+	defer writer.Flush()
+	var n, k int
+	sc.Split(bufio.ScanWords)
+	sc.Scan()
+	n, _ = strconv.Atoi(sc.Text())
+	sc.Scan()
+	k, _ = strconv.Atoi(sc.Text())
+
+	var ns []int
+	var a int
+	for i := 0; i < n; i++ {
+		sc.Scan()
+		a, _ = strconv.Atoi(sc.Text())
+		ns = append(ns, a)
+	}
+	sort.Ints(ns)
+	fmt.Println(ns[k-1])
+}
diff --git a/boj/1475/main/main.go b/boj/1475/main/main.go
@@ -0,0 +1,27 @@
+package main
+
+import "fmt"
+
+func main() {
+	var s string
+	fmt.Scanln(&s)
+	ans := 0
+	cards := make([]int, 9)
+	for _, c := range s {
+		n := c - '0'
+		if n == 9 {
+			n = 6
+		}
+		if cards[n] > 0 {
+			cards[n] -= 1
+			continue
+		}
+		for i := range cards {
+			cards[i]++
+		}
+		ans += 1
+		cards[6]++
+		cards[n]--
+	}
+	fmt.Println(ans)
+}
diff --git a/boj/1655/main.go b/boj/1655/main.go
@@ -0,0 +1,70 @@
+package main
+
+import (
+	"bufio"
+	"container/heap"
+	"fmt"
+	"os"
+)
+
+type IntMinHeap []int
+
+func (h IntMinHeap) Len() int           { return len(h) }
+func (h IntMinHeap) Less(i, j int) bool { return h[i] < h[j] }
+func (h IntMinHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }
+
+func (h *IntMinHeap) Push(x interface{}) {
+	*h = append(*h, x.(int))
+}
+
+func (h *IntMinHeap) Pop() interface{} {
+	old := *h
+	n := len(old)
+	x := old[n-1]
+	*h = old[0 : n-1]
+	return x
+}
+
+func (h *IntMinHeap) Last() int {
+	n := len(*h)
+	x := (*h)[n-1]
+	return x
+}
+
+
+func (h *IntMinHeap) Top() int {
+	x := (*h)[0]
+	return x
+}
+
+var reader = bufio.NewReaderSize(os.Stdin, 4000004)
+var writer = bufio.NewWriter(os.Stdout)
+
+func main() {
+	defer writer.Flush()
+	var count int
+	fmt.Fscanln(reader, &count)
+	minHeap := &IntMinHeap{}
+	maxHeap := &IntMinHeap{}
+	heap.Init(minHeap)
+	heap.Init(maxHeap)
+	for i := 0; i < count; i++ {
+		var n int
+		fmt.Fscanln(reader, &n)
+		if maxHeap.Len() == minHeap.Len() {
+			heap.Push(maxHeap, -n)
+		} else {
+			heap.Push(minHeap, n)
+		}
+		if i >= 1 && -maxHeap.Top() > minHeap.Top() {
+			// swap last
+			n = -heap.Pop(maxHeap).(int)
+			temp := heap.Pop(minHeap).(int)
+
+			heap.Push(minHeap, n)
+			heap.Push(maxHeap, -temp)
+		}
+
+		fmt.Fprintln(writer, -maxHeap.Top())
+	}
+}
