QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#512039 | #9177. String and Nails | ucup-team045# | WA | 0ms | 3544kb | C++20 | 622b | 2024-08-10 13:21:17 | 2024-08-10 13:21:20 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<vector>
#include<array>
#include<algorithm>
using namespace std;
using LL = long long;
int main(){
#ifdef LOCAL
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
#endif
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
vector<array<int, 2> > p(n);
for(int i = 0; i < n; i++){
int x, y;
cin >> x >> y;
p[i] = {x, y};
}
sort(p.begin(), p.end());
for(int i = 0; i < n - 1; i++){
cout << p[i][0] << ' ' << p[i][1] << '\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3544kb
input:
3 1 1 2 4 3 1
output:
1 1 2 4
result:
wrong answer Token parameter [name=YES or NO] equals to "1", doesn't correspond to pattern "[A-Za-z]+"