# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077959 | Acanikolic | Weighting stones (IZhO11_stones) | C++14 | 1066 ms | 596 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>
#define int long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 1e9;
bool does(vector<int>a,vector<int>b) {
//does a greater than b
if(b.size() == 0) return 1;
if(a.size() < b.size()) return 0;
sort(a.rbegin(),a.rend());
sort(b.rbegin(),b.rend());
for(int i = 0; i < b.size(); i++) {
if(b[i] > a[i]) return 0;
}
return 1;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int>a,b;
for(int i = 1; i <= n; i++) {
int x,y;
cin >> x >> y;
if(y == 1) a.pb(x);
else b.pb(x);
if(does(a,b)) {
cout << ">\n";
}else if(does(b,a)) {
cout << "<\n";
}else {
cout << "?\n";
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |