#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> v;
bool sorted(const pair<int, int> &a, const pair<int, int> &b)
{
if (a.first == b.first)
return a.second > b.second;
return a.first > b.first;
}
int main()
{
// bf
map<int, vector<int>> ma;
map<int, int> mac;
int n, a, b;
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> a >> b;
v.push_back({b, a});
mac[i-1] = 0;
}
cout << n;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2074 ms |
161648 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2037 ms |
173904 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2074 ms |
161648 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |