oj.uz

Submission #533481

# Submission time Handle Problem Language Result Execution time Memory
533481 2022-03-06T07:06:06 Z andecaandeci Best Place (NOI17_bestplace) C++17
100 / 100
 38 ms 3780 KB 
#include <bits/stdc++.h>
using namespace std;

#define nyahalo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define otsumiko exit(0);
#define mikodanye priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<pair<long long, long long> > >
#define mikochi priority_queue<long long, vector<long long>, greater<long long> >

int main() {
  nyahalo
  long long n;
  cin >> n;
  long long x[n+1], y[n+1];
  for (long long i=1; i<=n; i++) {
    cin >> x[i] >> y[i];
  }
  sort(x+1, x+n+1);
  sort(y+1, y+n+1);
  cout << x[(n+1)/2] << " " << y[(n+1)/2] << "\n";
  otsumiko
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2948 KB Output is correct
2 Correct 23 ms 3000 KB Output is correct
3 Correct 23 ms 3016 KB Output is correct
4 Correct 22 ms 2988 KB Output is correct
5 Correct 24 ms 3004 KB Output is correct
6 Correct 22 ms 2996 KB Output is correct
7 Correct 26 ms 2948 KB Output is correct
8 Correct 29 ms 3004 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 324 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 3780 KB Output is correct
2 Correct 37 ms 3772 KB Output is correct
3 Correct 26 ms 3756 KB Output is correct
4 Correct 33 ms 3012 KB Output is correct
5 Correct 38 ms 3760 KB Output is correct
6 Correct 34 ms 3780 KB Output is correct
7 Correct 37 ms 3756 KB Output is correct
8 Correct 34 ms 3772 KB Output is correct