Contest Duration: - (local time) (110 minutes) Back to Home

Submission #844758

Source Code Expand

Copy
```import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.Collections;
import java.io.InputStream;

/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author ilyakor
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
OutputWriter out = new OutputWriter(outputStream);
TaskB solver = new TaskB();
solver.solve(1, in, out);
out.close();
}

static class TaskB {
public void solve(int testNumber, InputReader in, OutputWriter out) {
int n = in.nextInt();
ArrayList<ii> a = new ArrayList<>();
for (int i = 0; i < n; ++i) {
int x = in.nextInt();
a.add(new ii(x, i % 2));
}
Collections.sort(a);
int res = 0;
for (int i = 0; i < a.size(); i += 2) {
res += a.get(i).second;
}
out.printLine(res);
}

}

static class OutputWriter {
private final PrintWriter writer;

public OutputWriter(OutputStream outputStream) {
writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
}

public OutputWriter(Writer writer) {
this.writer = new PrintWriter(writer);
}

public void print(Object... objects) {
for (int i = 0; i < objects.length; i++) {
if (i != 0) {
writer.print(' ');
}
writer.print(objects[i]);
}
}

public void printLine(Object... objects) {
print(objects);
writer.println();
}

public void close() {
writer.close();
}

}

static class InputReader {
private InputStream stream;
private byte[] buffer = new byte[10000];
private int cur;
private int count;

public InputReader(InputStream stream) {
this.stream = stream;
}

public static boolean isSpace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}

public int read() {
if (count == -1) {
throw new InputMismatchException();
}
try {
if (cur >= count) {
cur = 0;
count = stream.read(buffer);
if (count <= 0)
return -1;
}
} catch (IOException e) {
throw new InputMismatchException();
}
return buffer[cur++];
}

public int readSkipSpace() {
int c;
do {
c = read();
} while (isSpace(c));
return c;
}

public int nextInt() {
int sgn = 1;
int c = readSkipSpace();
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res = res * 10 + c - '0';
c = read();
} while (!isSpace(c));
res *= sgn;
return res;
}

}

static class ii implements Comparable<ii> {
public int first;
public int second;

public ii() {
}

public ii(int first, int second) {
this.first = first;
this.second = second;
}

public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;

ii ii = (ii) o;

if (first != ii.first) return false;
if (second != ii.second) return false;

return true;
}

public int hashCode() {
int result = first;
result = 31 * result + second;
return result;
}

public int compareTo(ii o) {
if (first != o.first) {
return first < o.first ? -1 : 1;
}
if (second != o.second) {
return second < o.second ? -1 : 1;
}
return 0;
}

public String toString() {
return "{" +
"first=" + first +
", second=" + second +
'}';
}

}
}

```

#### Submission Info

Submission Time 2016-08-21 21:06:58+0900 C - BBuBBBlesort! ilyakor Java8 (OpenJDK 1.8.0) 600 5136 Byte AC 293 ms 14492 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
 AC × 2
 AC × 24
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 290 ms 14456 KB
02.txt AC 289 ms 14292 KB
03.txt AC 289 ms 14492 KB
04.txt AC 293 ms 14452 KB
05.txt AC 286 ms 14492 KB
06.txt AC 282 ms 14132 KB
07.txt AC 290 ms 14444 KB
08.txt AC 201 ms 12244 KB
09.txt AC 206 ms 12372 KB
10.txt AC 213 ms 12368 KB
11.txt AC 218 ms 12496 KB
12.txt AC 226 ms 12880 KB
13.txt AC 210 ms 12372 KB
14.txt AC 282 ms 14200 KB
15.txt AC 286 ms 14204 KB
16.txt AC 286 ms 14404 KB
17.txt AC 270 ms 14492 KB
18.txt AC 154 ms 8148 KB
19.txt AC 158 ms 8148 KB
20.txt AC 156 ms 8148 KB
21.txt AC 154 ms 8148 KB
22.txt AC 161 ms 8148 KB
s1.txt AC 161 ms 8148 KB
s2.txt AC 158 ms 8148 KB