oj.uz

Submission #696229

# Submission time Handle Problem Language Result Execution time Memory
696229 2023-02-06T02:45:45 Z igu Best Place (NOI17_bestplace) C++17
100 / 100
 92 ms 3084 KB 
#include<iostream>
#include <bits/stdc++.h>

using namespace std;

double median(int arr[], int size){
   sort(arr, arr+size);
   if (size % 2 != 0)
      return (double)arr[size/2];
   return (double)(arr[(size-1)/2] + arr[size/2])/2.0;
}

int main() {
   int x;
   cin >> x;
   int ans;
   int bns;
   int a;
   int b;
   int arr[x]; 
   int brr[x];
   for (int i = 0; i < x; i++){
      cin >> a >> b;
      arr[i]=a;
      brr[i]=b;
   }
    ans = median(arr,x);
    bns = median(brr,x);
	cout << ans << " " << bns;
	return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2064 KB Output is correct
2 Correct 67 ms 2184 KB Output is correct
3 Correct 61 ms 2188 KB Output is correct
4 Correct 55 ms 2228 KB Output is correct
5 Correct 63 ms 2220 KB Output is correct
6 Correct 63 ms 2124 KB Output is correct
7 Correct 58 ms 2056 KB Output is correct
8 Correct 75 ms 2196 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 3084 KB Output is correct
2 Correct 92 ms 2956 KB Output is correct
3 Correct 78 ms 2960 KB Output is correct
4 Correct 66 ms 2280 KB Output is correct
5 Correct 88 ms 2964 KB Output is correct
6 Correct 87 ms 2952 KB Output is correct
7 Correct 90 ms 2984 KB Output is correct
8 Correct 87 ms 2952 KB Output is correct