USACO Silver 2016 Open - Diamond Collector

C++

Implementation

#include <bits/stdc++.h>

using namespace std;

int main() {
	freopen("diamond.in", "r", stdin);
	freopen("diamond.out", "w", stdout);

	int n, k; cin >> n >> k;
	int A[n];

Java

Implementation

Source: Nick Wu, from the official USACO editorial

import java.io.*;
import java.util.*;
public class diamondS {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("diamond.in"));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("diamond.out")));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		int[] list = new int[n];

Python

Implementation

import sys

sys.stdin = open("diamond.in", "r")
sys.stdout = open("diamond.out", "w")

n, k = map(int,input().split())
a = sorted([int(input()) for i in range(n)])

mx = [0]*(n+1) # maximum number of diamonds assuming i is the smallest diamond
j = 0