oj.uz

Submission #466129

# Submission time Handle Problem Language Result Execution time Memory
466129 2021-08-18T03:42:15 Z Nanogines Best Place (NOI17_bestplace) C++14
100 / 100
 43 ms 3140 KB 
#include <bits/stdc++.h>
using namespace std;


#define fastio ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define forn(i, a, b) for (int i=a; i<b; i++)
#define fore(i, a, b) for (int i=a; i<=b; i++)
typedef vector<int> vi;

void fast_io() {
  fastio;
}


signed main()
{
  fast_io();
  int n;
  cin >> n;
  int c, d;
  vi a(n), b(n);
  forn (i, 0, n) cin >> a[i] >> b[i];
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  cout << a[(n - 1) / 2] << " " << b[(n - 1) / 2] << endl;
}

Compilation message

bestplace.cpp: In function 'int main()':
bestplace.cpp:20:7: warning: unused variable 'c' [-Wunused-variable]
   20 |   int c, d;
      |       ^
bestplace.cpp:20:10: warning: unused variable 'd' [-Wunused-variable]
   20 |   int c, d;
      |          ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 308 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 332 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1116 KB Output is correct
2 Correct 30 ms 2252 KB Output is correct
3 Correct 30 ms 2252 KB Output is correct
4 Correct 24 ms 2248 KB Output is correct
5 Correct 28 ms 2244 KB Output is correct
6 Correct 30 ms 2252 KB Output is correct
7 Correct 30 ms 2112 KB Output is correct
8 Correct 29 ms 2244 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 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 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1100 KB Output is correct
2 Correct 42 ms 3028 KB Output is correct
3 Correct 30 ms 2992 KB Output is correct
4 Correct 38 ms 2236 KB Output is correct
5 Correct 43 ms 3004 KB Output is correct
6 Correct 42 ms 3140 KB Output is correct
7 Correct 41 ms 3012 KB Output is correct
8 Correct 42 ms 3008 KB Output is correct