# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515773 | acatmeowmeow | Preokret (COCI18_preokret) | C++11 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, cnt = 0;
cin >> n;
vector<pair<int, int>> arr;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if(x <= 1440) cnt++;
arr.push_back({x, 1});
}
int m;
cin >> m;
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
if (x <= 1440) cnt++;
arr.push_back({x, 2});
}
sort(arr.begin(), arr.end());
vector<pair<int, int>> res(n + m + 5);
res[0] = (arr[0].second == 1 ? pair<int, int>(1, 0) : pair<int, int>(0, 1));
for (int i = 1; i < arr.size(); i++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |