#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <bitset>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
using namespace std;
int main() {
vector < pair <int, int> > vec;
int n, m;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec.push_back({x, 0});
}
cin >> m;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
vec.push_back({x, 1});
}
sort(vec.begin(), vec.end());
int ans = 0, res = 0;
int lst = -1;
int a = 0, b = 0;
for (int i = 0; i < vec.size(); i++) {
ans += vec[i].first <= 1440;
if (vec[i].second == 0) {
a++;
if (a > b && b > 0 && (lst == -1 || lst == 1)) {
lst = 0;
res++;
}
} else {
b++;
if (b > a && a > 0 && (lst == -1 || lst == 0)) {
lst = 1;
res++;
}
}
}
cout << ans << endl << res << endl;
return 0;
}
Compilation message
preokret.cpp: In function 'int main()':
preokret.cpp:40:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < vec.size(); i++) {
~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
368 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
256 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
364 KB |
Output is correct |
| 6 |
Partially correct |
2 ms |
384 KB |
Output is partially correct |
| 7 |
Correct |
3 ms |
384 KB |
Output is correct |
| 8 |
Partially correct |
3 ms |
500 KB |
Output is partially correct |
| 9 |
Partially correct |
3 ms |
384 KB |
Output is partially correct |
| 10 |
Partially correct |
2 ms |
384 KB |
Output is partially correct |
