Submission #142553

#TimeUsernameProblemLanguageResultExecution timeMemory
142553vardan__02Weighting stones (IZhO11_stones)C++14
0 / 100
3 ms504 KiB
#include <iostream> #include <fstream> #include <algorithm> #include <cstring> #include <string> #include <vector> #include <cstdio> #include <queue> #include <deque> #include <stack> #include <cmath> #include <list> #include <set> #include <map> using namespace std; typedef long long ll; #define MP make_pair #define PB push_back ll n,s,r,a[10],i,j,k,p; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n; for(i=1;i<=n;i++) { cin>>r>>s; a[s]+=r; if(a[1]==a[2]) cout<<"?"<<endl; if(a[1]<a[2]) cout<<"<"<<endl; if(a[1]>a[2]) cout<<">"<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...