結果
問題 | No.59 鉄道の旅 |
ユーザー |
![]() |
提出日時 | 2014-11-07 01:17:12 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 516 ms / 5,000 ms |
コード長 | 2,724 bytes |
コンパイル時間 | 1,935 ms |
コンパイル使用メモリ | 111,660 KB |
実行使用メモリ | 23,936 KB |
最終ジャッジ日時 | 2024-12-24 20:16:56 |
合計ジャッジ時間 | 3,294 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 12 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Linq;internal class Program{private static void Push(List<int> list, int element){var left = 0;var right = list.Count - 1;while (right - left > 1){int middle = (right + left) / 2;if (list[middle] == element){list.Insert(middle, element);return;}if (list[middle] > element){right = middle;}else{left = middle;}}for (int i = left; i <= right; i++){if (list[i] == element){list.Insert(i, element);return;}if (list[i] > element){list.Insert(i, element);return;}}list.Add(element);}private static void Remove(List<int> list, int element){var left = 0;var right = list.Count - 1;while (right - left > 1){int middle = (right + left) / 2;if (list[middle] == element){list.RemoveAt(middle);return;}if (list[middle] > element){right = middle;}else{left = middle;}}for (int i = left; i <= right; i++){if (list[i] == element){list.RemoveAt(i);return;}}}public static void Main(string[] args){var nAndK = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();var n = nAndK[0];var k = nAndK[1];var w = new int[n];for (int i = 0; i < n; i++){w[i] = int.Parse(Console.ReadLine());}var list = new List<int>();for (int i = 0; i < n; i++){if (w[i] < 0){Remove(list, -w[i]);}else{int index = list.Count - k;if (index < 0){Push(list, w[i]);continue;}if (list[index] >= w[i]){continue;}Push(list, w[i]);}}Console.WriteLine(list.Count);}}