oj.uz

Submission #142553

# Submission time Handle Problem Language Result Execution time Memory
142553 2019-08-09T14:17:02 Z vardan__02 Weighting stones (IZhO11_stones) C++14
0 / 100
 3 ms 504 KB 
#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;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -