src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class A
{
public A()
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Integer mas[] = new Integer[n];
int b = 0;
for (int i = 0 ; i < n ; i ++)
{
mas[i]... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;
public class D {
public static void main(String[] args) throws FileNotFoundException {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
int[] p = new int[n];
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
public class A
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
String FInput="";
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin
else
{
try... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.InputMismatchException;
public class R111_D2_A {
public static void main(String[] args) {
InputReader in = new InputReader(System.in);
... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
public class A {
public static void main(String args[]){
Scanner in = new Scanner(System.in);
int n=in.nextInt(),s=0;
int[] a= new int[n];
for (int i=0;i<n;i++) {a[i]=in.nextInt(); s+=a[i];}
Arrays.sort(a); int k=0,ans=0;
for (int i=n-1;i>=0;i--)
if (k<=s/2) {k+=a[i];ans++;}
System.ou... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at... | nlogn | 160_A. Twins | CODEFORCES |
//coded by : ariefianto17 | Reza Ariefianto
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
public static void main (String[]args)
{
Scanner read = new Scanner (new BufferedInputStream (System.in));
int n = read.nextInt();
int[]arr = new int[n];
int sum=0;
int sum2=0;
int c... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.StringTokenizer;
public class solver {
FastScanner in = new FastScanner(System.in);
PrintW... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
public class Main
{
public static void main(String args[]) throws IOException
{
Scanner c=new Scanner(System.in);
int N=c.nextInt();
int A[]=new int[N];
for(int i=0;i<N;i++)
{
A[i]=c.nextInt();
}
Arrays.sort(A);
int sum=0;
for(int i=0... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] A = new int[n];
int sum = 0;
for (int i = 0; i < n; i++) {
A[i] = in.nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class CF_111_A {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt(), sum = 0, sum2 = 0;
int[] a = new int[n];
for (int i = 0; i < n; i++){
a[i] = in.nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
public class A {
int n;
int[] a;
public void run() throws IOException{
Scanner s = new Scanner(new InputStreamReader(System.in));
//BufferedReade... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
void solve() throws IOException {
int n = nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tokenizer=null;
public static void main(String[] args) throws IOException
{
new Main().execute();
}
void debug(Object...os)
{
System.out... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
public class A {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int[] a = new int[n];
for(int i=0;i<n;i++) a[i] = s.nextInt();
int r = 0, an = 0;
Arrays.sort(a);
int t = 0;
for(int z : a) t += z;
for(int i=a.length-1;i>=0;i--){
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solution implements Runnable {
public static void main(String[] args) {
(new Thread(null, new Solution(), "1", 1l << 28)).s... | nlogn | 160_A. Twins | CODEFORCES |
import static java.lang.Math.*;
import java.util.*;
import java.io.*;
public class A {
public void solve() throws Exception {
int n = nextInt();
int[] p = nextArr(n);
Arrays.sort(p);
int sum = 0;
for (int i=0; i<n; ++i) sum+=p[i];
int curr = 0;
for ... | nlogn | 160_A. Twins | CODEFORCES |
//Edwin Lunando template for online algorithm contest
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.StringTokenizer;
public class Main {
// class node implements Comparabl... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
private MyScanner in;
private PrintWriter out;
private void solve() {
int n = in.nextInt();
int[] a = new int[n];
int all = 0;
for (int i = 0; i < n; ++i) {
a[i] = in.nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
public class codeee {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
if(n==1){System.out.println(1); return;}
int []mas=new int[n];
int sum=0;
for (int i = 0; i < n; i++) {
mas[i]=sc.next... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author codeKNIGHT
*/
public class Main {
public static void main(String[] args) {... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main implements Runnable {
PrintWriter out;
BufferedReader in;
StringTokenizer st;
void solve() throws Exception {
int n = ne... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
public class Solution {
public static void main(String [] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int [] a = new int [n];
int i;
int s = 0;
for (i = 0; i < n; i++) {
a[i] = scan.nextInt();
s +=... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public class Test {
static BufferedReader reader;
static StringTokenizer ... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Round111A {
public static void main(String[] args) throws IOException {
new Round111A().run... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class C111A{
static BufferedReader br;
public static void main(String args[])throws Exception{
br=new BufferedReader(new InputStreamReader(System.in));
int n = toInt();
int nm[] = toIntArray();
double a=0.0... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public A () throws IOException {
int N = sc.nextInt();
int [] A = new int [N];
for (int n = 0; n < N; ++n)
A[n] = sc.nextInt();
solve(N, A);
}
public void solve (int N, int [] A) {
//start();
Arrays.sort(A);
int S1 = 0;
for (int n = 0; n <... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solver {
StringTokenizer st;
BufferedReader in;
PrintWriter out;
public static void main(String[] args) thro... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class A implements Runnable {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer tok;
@Override
public void run() {
try {
long startTime = System.curre... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class con111_A {
public static void main( final String[] args ) throws IOException {
final BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );
fina... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Twins {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] val = new int[n];
for (int i=0; i<n; i++)
val[i] = in.nextInt();
Arrays.sort(val);
... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Round111ProbA {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[]a = new int[n];
int s =0;
for(int i =0 ; i < n;i++)
{
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
import java.lang.Math.*;
public class A111
{
public static void main(String args[])throws Exception
{
Scanner in=new Scanner(System.in);
// br=new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw=new PrintWriter(System.out);
... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class round111A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [] coins = new int [n];
for(int i = 0 ; i < n ; ++i)
coins[i] = sc.nextInt();
Arr... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
public class TaskA {
public static void main(String[] args) throws Exception {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = scanner.nextInt... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class nA {
Scanner in;
PrintWriter out;
void solve() {
int n = in.nextInt();
int a[] = new int[n];
int sum = 0;
for (int i = 0; i < n; i++) {
a[i] = in.nextInt();
... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* @author Andrew Porokhin, andrew.porokhin@gmail.com
*/
public class Problem111A implements Runnable {
void solve() throws Numbe... | nlogn | 160_A. Twins | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Testt {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer t... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.Map.*;
public class codeforces {
static int count =0;
static boolean f=false;
static int [] arr;
static PrintWriter pw=new PrintWriter(System.out);
static void solve(int index , int mask) {
if(index==arr.l... | nlogn | 994_B. Knights of a Polygonal Table | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class Main {
static StreamTokenizer st=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
public static void main(String[] args) {
in... | nlogn | 1159_C. The Party and Sweets | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new PrintStream(System.out));
StringTokenizer st = new StringToken... | nlogn | 1159_C. The Party and Sweets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.PriorityQueue;
import ja... | nlogn | 1159_C. The Party and Sweets | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import static java.lang.Math.*;
public class Main2 {
private FastScanner scanner = new FastScanner();
public static void main(String[] args) {
new Main2().solve();
}
private void... | nlogn | 976_C. Nested Segments | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
team[] t = new team[n];
for (int i = 0; i < n; i++)
t[i] = new team(in.ne... | nlogn | 166_A. Rank List | CODEFORCES |
import java.awt.Point;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt() - 1;
Point[] A = new Point[n];
fo... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class CF113_Div2_A implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer tok;
final boolean ONLINE_JUDGE = (System.getProperty("ONLINE_JUDGE") != null);
public static void main(String[] args) {
new Thread(null, ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
public class R113A {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt(), k = in.nextInt();
int[] ind = new int[n];
int[] p = new int[n];
int[] t = new int[n];
for (int i = 0; i < n; i++){
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
imp... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.security.SecureRandom;
import java.util.*;
import java.math.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
class Pair implements Comparable<Pair> {
int col;
int time;
int place;
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Solution
{
public static void main(String[] args) throws IOException
{
new Solution().run();
}
StreamTokenizer in;
Scanner ins;
PrintWriter out;
int nextInt() throws IOException
{
in.nextToken(... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.logging.Level;
import java.util.logging.Logger;
public class ProblemA {
private final B... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tokenizer=null;
public static void main(String[] args) throws IOException
{
new Main().execute();
}
void debug(Object...os)
{
System.out.p... | nlogn | 166_A. Rank List | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Start {
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
PrintWriter out;
StringTokenizer ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
public class C{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int n=in.nextInt(),key=in.nextInt(),ans=0;
int[] a = new int[101], b = new int[101];
for (int i=1;i<=n;i++) {a[i]=in.nextInt();b[i]=in.nextInt();}
for (int i=1;i<n;i++)
for... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int N = r.nextInt();
int K = r.nextInt() - 1;
T[] a = new T[N];
for(int i = 0; i < N; i+... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
public class ProblemA {
public static class Team {
int solved;
int penalty;
Team(int s, int p) {
solved = s;
penalty = p... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
static class T
{
public int s,p;
}
public static void main(String args[]) throws Exception
{
InputReader sc=new InputReader(System.in);
int n=sc.readInt(),k=sc.readInt(),i,j,z;
T m[]=new T[n];
for(i=0;i<n;i++) {m[i]=new T();m[i].s=sc.readInt();m[i].... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class AA {
static class O implements Comparable<O> {
int problems;
int penalty;
public O(int p, int pp) {
problems = p;
penalty = pp;
}
public int compareTo(O arg0) {
if (problems == arg0.problems) {
return penalty - arg0.penalty;
}
return -(... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;
public class R113_D2_A {
public static void main(String[] args) throws NumberFormatException,
IOException {
// BufferedReader in = new BufferedReader(new
// InputSt... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class A
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
String FInput="";
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin
else
{
try... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class C113A{
static BufferedReader br;
public static void main(String args[])throws Exception{
br=new BufferedReader(new InputStreamReader(System.in));
int nm[]=toIntArray();
int n=nm[0];
int k=nm[1];
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
class Team implements Comparable<Team>{
int ac;
int penalty;
public Team(int ac, int penalty) {
this.ac = ac;
th... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
import java.awt.Point;
import static java.lang.Math.*;
public class P166A {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
Point[] P = new Point[n];
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
public static void main(String[] argv) {
new Main().run();
}
void run() {
in = new Scanner(System.in);
out = new PrintWriter(System.out);
try {
solve();
} finally {
out.... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class A {
static StreamTokenizer st;
static PrintWriter pw... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
/**
* @param args
*/
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt()-1;
team[] t = new team[n];
for(int i = 0 ;i < n ; i++)
t[i] = new team(scan.nex... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int k = input.nextInt() - 1 ;
int a[][] = new int[n][2];
for (int i = 0;i <n; i++) {
a[i][0]=input.nextInt();
... | nlogn | 166_A. Rank List | CODEFORCES |
//package codeforces;
import java.util.*;
public class Main {
class team implements Comparable<team>{
int pro,time;
public int compareTo(team oth) {
if(pro>oth.pro)
return -1;
if(pro==oth.pro&&time<oth.time)
return -1;
// TODO Au... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.MathContext;
public class Main {
private void solve() {
int n = in.nextInt();
int k = in.nextInt();
final int[] p = new int[n];
final int[] t = new int[n];
for(... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Locale;
import java.util.StringTokenizer;
public class A {
private class Pair {
public final i... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Round113_A {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt() - 1;
Obe[] a = new Obe[n];
for (int i = 0; i < n; i++)
a[i] = ne... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.List;
import java.util.Scanner;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class P113A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintStream out = System.out;
//CODING TAIM
int n = sc.nextInt();
int k = sc.nextInt();
List<Te... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class A
{
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = null;
private void solve() throws IOException
{
int n =... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt(), k = in.nextInt();
int x[] = new int[n];
for (int i = 0; i < n; i++) {
int p = in.nextInt(), t ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solution {
static class Team implements Comparable<Team> {
int pr;
int time;
int id;
public Team(int P, int T, int I)... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Teams {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
Random rnd;
class Pair implements Comparable<Pair> {
int a, b;
public Pair(int a, int b) {
this.a = a;
this.b = b;
... | nlogn | 166_A. Rank List | CODEFORCES |
import sun.reflect.generics.tree.Tree;
import java.io.*;
import java.util.*;
public class A2 {
static Scanner in; static int next() throws Exception {return in.nextInt();};
// static StreamTokenizer in; static int next() throws Exception {in.nextToken(); return (int) in.nval;}
// static BufferedReader in;
static Pr... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A113 {
public static void main(String[] args) {
new A113().run();
}
public void run() {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
Team[] teams = new Team[n];... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author codeKNIGHT
*/
public class Main {
public static void main(String[] args) {... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
import java.util.Arrays;
public class P166A
{
public static void main(String[] args)
{
Scanner myScanner = new Scanner(System.in);
int n = myScanner.nextInt();
int k = myScanner.nextInt();
Team[] queue = new Team[n];
for (int i = 0; i < n; i++)
{
queue[i] = new Team(myScann... | nlogn | 166_A. Rank List | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
public class A {
private void solve() throws IOExcept... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Arrays;
public class A {
static class team implements Comparable<team>
{
int problems;
int penalty;
public team(int problems,int penalty)
{
this.penalty=pena... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Vector;
public class Solution {
class... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
class Team implements Comparable<Team>{
int p, t;
public Team(int p, int t) {
this.p = p;
this.t = t;
}
public int compareTo(Team other) {
if (this.p != other.p) return other.p - this.p;
return this.t - other.t;
}
}
public void solve() ... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.io.*;
public class cf166a {
private static boolean[][] matrix;
private static int n;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// long l = sc.nextLong();
// int i = sc.nextInt();
// String input = sc.nextLine();
int n = sc.nextInt();
in... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws Exception{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt() - 1;
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
... | nlogn | 166_A. Rank List | CODEFORCES |
//package round113;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
public class A {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), k = ni();
int[]... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author hheng
*/
public class Main {
public static void main(String[] args) {
In... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Solver {
StringTokenizer st;
BufferedReader in;
PrintWriter out;
public static void main(String[] args) thro... | nlogn | 166_A. Rank List | CODEFORCES |
import java.util.Arrays;
/**
* @author piuspratik (Piyush Das)
*/
public class TaskA {
class Contest implements Comparable<Contest>
{
int problems;
int penalty;
Contest (int problems, int penalty) {
this.problems = problems;
this.penalty = penalty;
}... | nlogn | 166_A. Rank List | CODEFORCES |
//package fourninetysixDiv3;
import java.util.HashMap;
import java.util.Scanner;
public class Median_Segments_general {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int m = s.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = s.n... | nlogn | 1005_E1. Median on Segments (Permutations Edition) | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
public class Main {
static BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
st... | nlogn | 1005_E1. Median on Segments (Permutations Edition) | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.function.Function;
public class Main {
static int N;
static int[] U, V;
static int[] A;
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
N = sc.nextInt();
U = new int[N-1];
V = ... | nlogn | 1037_D. Valid BFS? | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class MicroWorld {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = ne... | nlogn | 990_B. Micro-World | CODEFORCES |
/*
Keep solving problems.
*/
import java.util.*;
import java.io.*;
public class CFA {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
private static long MOD = 1000L * 1000L * 1000L + 7;
private static final int[] dx = {0, -1, 0, 1};
private static final int[] dy = {1,... | nlogn | 1080_E. Sonya and Matrix Beauty | CODEFORCES |
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StringWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.io.Inp... | nlogn | 1075_C. The Tower is Going Home | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.